Rina Dechter  Home/Search
Context Related
| uci.edu/~csp/r48b.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uci.edu/~dechter/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional satisfiability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination for solving linear equalities and inequalities, and dynamic programming for combinatorial optimization, can all be accommodated within the bucket elimination framework. Many probabilistic... (Update)
Similar documents based on text: More All
2.4: Bucket Elimination: a Unifying Framework for Structure-driven.. - Dechter (1998) (Correct)
1.3: Bucket Elimination: a Unifying Framework for Processing Hard and.. - Dechter (1998) (Correct)
1.1: A Scheme for Approximating Probabilistic Inference - Dechter, Rish (1997) (Correct)
BibTeX entry: (Update)
R. Dechter, Bucket elimination: A unifying framework for reasoning, Articial Intelligence 113, (1999), 41-85. http://citeseer.ist.psu.edu/article/dechter99bucket.html More
@article{ dechter99bucket,
author = "Rina Dechter",
title = "Bucket Elimination: A Unifying Framework for Reasoning",
journal = "Artificial Intelligence",
volume = "113",
number = "1-2",
pages = "41-85",
year = "1999",
url = "citeseer.ist.psu.edu/article/dechter99bucket.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of np-co.. (context) - Garey, Johnson - 1979
760 Probabilistic Reasoning in Intelligent Systems (context) - Pearl - 1988
582 Local computation with probabilities on graphical structures.. (context) - Lauritzen, Spiegelhalter - 1988
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
390 A machine program for theorem proving (context) - Davis, Logemann et al. - 1962
267 Network-based heuristics for constraint satisfaction problem.. (context) - Dechter, Pearl - 1987
211 Enhancement schemes for constraint processing: Backjumping (context) - Dechter - 1990
185 A sufficient condition for backtrack-free search (context) - Freuder - 1982
166 Evaluating influence diagrams (context) - Shachter - 1986
141 Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
135 Bayesian updating in causal probabilistic networks by local .. (context) - Jensen, Lauritzen et al. - 1990
132 Bucket elimination: A unifying framework for probabilistic i.. - Dechter - 1998
132 Bucket elimination: A unifying framework for probabilistic i.. - Dechter - 1996
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
96 Context-specific independence in bayesian networks - Boutilier - 1996
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~dechter/publications/): More
Up and Down Mini-Buckets: A Scheme for Approximating.. - Kask, Larrosa, Dechter (2001) (Correct)
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (Correct)
On the Time Complexity of Bucket Elimination Algorithms - Larrosa (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC