Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Tree clustering for constraint networks (research note)
Artificial Intelligence
Decomposing a relation into a tree of binary relations
Journal of Computer and System Sciences
Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
Artificial Intelligence
Graphical models for machine learning and digital communication
Graphical models for machine learning and digital communication
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Topological parameters for time-space tradeoff
Artificial Intelligence
A comparison of structural CSP decomposition methods
Artificial Intelligence
A general scheme for automatic generation of search heuristics from specification dependencies
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Local computation with valuations from a commutative semigroup
Annals of Mathematics and Artificial Intelligence
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Constraint Processing
Theory of Relational Databases
Theory of Relational Databases
Iterative join-graph propagation
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
AND/OR search spaces for graphical models
Artificial Intelligence
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
On the Practical Significance of Hypertree vs. TreeWidth
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Mixed deterministic and probabilistic networks
Annals of Mathematics and Artificial Intelligence
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ODPOP: an algorithm for open/distributed constraint optimization
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Cutset sampling for Bayesian networks
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
PC-DPOP: a new partial centralization algorithm for distributed optimization
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
MB-DPOP: a new memory-bounded algorithm for distributed optimization
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hi-index | 0.00 |
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the cliquetree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can provide a speed-up of n over BE for various reasoning tasks. Time-space tradeoffs of tree-decomposition processing are analyzed.