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)
Related documents from co-citation: More All
28: Probabilistic Reasoning in Intelligent Systems (context) - Pearl - 1988
23: Local computations with probabilities on graphical structures and their applicat.. (context) - Lauritzen, Spiegelhalter - 1988
23: A scheme for approximating probabilistic inference - Dechter, Rish - 1997
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
77 Nonserial Dynamic Programming (context) - Bertele, Brioschi - 1972
72 Probabilistic inference and influence diagrams (context) - Shachter - 1988
61 Linear time algorithms for np-hard problems restricted to pa.. (context) - Arnborg, Proskourowski
61 Directional resolution: The davis-putnam procedure - Dechter, Rish - 1994
59 Identifying independence in bayesian networks (context) - Geiger, Verma et al. - 1990
56 Exploiting causal independence in bayesian network inference - Zhang, Poole - 1996
55 Valuation-based systems for bayesian decision analysis (context) - Shenoy - 1992
51 Theoretical Computer Science (context) - Dechter, van Beek et al. - 1997
42 Dynamic variable ordering in csps - Bacchus, van Run - 1995
40 Semiring-based constraint satisfaction and optimization - Bistarelli, Montanari et al. - 1997
37 Symbolic probabilistic inference in belief networks (context) - D'Ambrosio, Shachter et al. - 1990
34 Optimization in constraint networks (context) - Dechter, Dechter et al. - 1990
34 the generation of alternative explanations with implications.. - Santos - 1991
32 A new algorithm for finding map assignments to belief networ.. (context) - Shimony, Charniak - 1991
29 Encyclopedia of Artificial Intelligence (context) - Dechter - 1992
28 IEEE Transactions on Systems (context) - Tatman, Shachter et al. - 1990
28 Probability functions on complex pedigrees (context) - Cannings, Thompson et al. - 1978
27 A sufficiently fast algorithm for finding close to optimal j.. - Becker, Geiger - 1996
25 A connectionist model for diagnostic problem solving (context) - Peng, Reggia - 1989
25 An ordered examination of influence diagrams (context) - Shachter - 1990
23 Learning in boltzmann trees - Saul, Jordan - 1994
23 Probabilistic partial evaluation: Exploiting structure in pr.. - Poole - 1997
21 Mini-buckets: A general scheme of generating approximations .. - Dechter - 1997
20 Backtracking algorithms for constraint satisfaction problems.. - Dechter, Frost - 1998
19 Topological parameters for time-space tradeoffs - Dechter - 1996
19 Efficient inference in bayes networks as a combinatorial opt.. (context) - Li, D'Ambrosio - 1994
14 On fourier's algorithm for linear constraints (context) - Lassez, Mahler - 1992
13 Local and global relational consistency - Dechter, van Beek - 1995
8 Hybrid algorithms for approximate belief updating in bayes n.. - Santos, Shimony et al.
8 Plausability of diagnostic hypothesis (context) - Peng, Reggia - 1986
7 To guess or to think (context) - Rish, Dechter - 1996
4 Conditioning methods for exact and approximate inference in .. - Darwiche - 1995
3 Composition principles for the synthesis of optimalmultistag.. (context) - Mitten
3 A computational scheme for reasoning in dynamic probabilisti.. (context) - Kjaeaerulff - 1993
2 A proctical algorithm for finding optimal triangulations (context) - Shoiket, Geiger - 1997
1 An evaluation of structural parameters for probabilistic rea.. (context) - El-Fattah, Dechter - 1996
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