AI Chat AI Image Generator AI Video Text to Speech

Topological Parameters for Time-Space Tradeoff

02/13/2013

∙

by Rina Dechter, et al.

∙

∙

In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space specification.

page 1

page 2

page 3

page 4

research

∙ 11/30/2022

(No) Quantum space-time tradeoff for USTCON

Undirected st-connectivity is important both for its applications in net...

0 Simon Apers, et al. ∙

research

∙ 02/13/2013

An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits

Many algorithms for processing probabilistic networks are dependent on t...

0 Yousri El Fattah, et al. ∙

research

∙ 07/10/2018

Improved Space-Time Tradeoffs for kSUM

In the kSUM problem we are given an array of numbers a_1,a_2,...,a_n and...

0 Isaac Goldstein, et al. ∙

research

∙ 10/19/2012

New Advances in Inference by Recursive Conditioning

Recursive Conditioning (RC) was introduced recently as the first any-spa...

0 David Allen, et al. ∙

research

∙ 01/16/2013

Any-Space Probabilistic Inference

We have recently introduced an any-space algorithm for exact inference i...

0 Adnan Darwiche, et al. ∙

research

∙ 02/03/2019

A Faster FPTAS for Knapsack Problem With Cardinality Constraint

We study the K-item knapsack problem (, 1.5-dimensional KP), which is a ...

0 Wenxin Li, et al. ∙

research

∙ 08/29/2019

A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon

In this paper we study the problem of computing the geodesic center of a...

0 Pardis Kavand, et al. ∙