See this document in CiteSeerX!

Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints (1998)  (Make Corrections)  (10 citations)
Rina Dechter
ACM Computing Surveys



  Home/Search   Context   Related

 
View or download:
uci.edu/pub/CSPrepository/pap...R64.ps
uci.edu/pub/CSPrepository/pap...R64.ps
uci.edu/pub/pub/csp/CSPreposi...R64.ps
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  uci.edu/pub/CSPrepository/pap... (more)
From:  uci.edu/pub/pub/csp/CSPreposi...
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Introduction The Constraint Satisfaction framework is quite restricted. Nevertheless, it is this restrictiveness that allowed the developments of very useful concepts such as constraint propagation (also know as "consistency enforcement"), through which various tractable subclasses had emerged and by which general purpose algorithms such as backtracking were improved [8,6,7,2]. However, real life problems frequently call for extending the basic model to allow nondeterminism as the... (Update)

Context of citations to this paper:   More

.... fdechter,irinarg ics.uci.edu Abstract This paper presents a class of approximate inference algorithms, based on bucket elimination [13], that trade accuracy for efficiency in cases when computational resources are bounded. Our approach applies the idea of local inference,...

...networks, to combinatorial optimization and to probabilistic reasoning. Our approach is based on bucket elimination [13] and offers adjustable levels of accuracy and efficiency. We identify regions of completeness and demonstrate promising empirical results obtained...

Cited by:   More
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998)   (Correct)
Empirical Evaluation of Approximation Algorithms for.. - Rish, Kask, Dechter (1998)   (Correct)

Similar documents (at the sentence level):   More
18.1%:   Bucket Elimination: a Unifying Framework for Structure-driven.. - Dechter (1998)   (Correct)
15.1%:   Mini-Buckets: A General Scheme for Generating Approximations in.. - Dechter (1997)   (Correct)
15.1%:   Bucket Elimination: A Unifying Framework for Reasoning - Dechter (1999)   (Correct)

Active bibliography (related documents):   More   All
0.0:   Boosting Search with Variable Elimination in Constraint.. - Larrosa, Dechter (2002)   (Correct)
0.0:   Consistency in General CSPs - Pang, Goodwin (2000)   (Correct)
0.0:   Constraint Programming - Group (1996)   (Correct)

Similar documents based on text:   More   All
0.1:   A Graph-Based Method for Improving GSAT - Kask, Dechter (1996)   (Correct)
0.1:   Constraint Tightness versus Global Consistency - van Beek, Dechter (1994)   (Correct)
0.1:   Dead-End Driven Learning - Frost, Dechter (1994)   (Correct)

Related documents from co-citation:   More   All
21:   Bucket elimination: A unifying framework for probabilistic inference - Dechter - 1996
9:   Near Shannon Limit Performance of Low Density Parity Check Codes - MacKay, Neal
9:   Turbo decoding as an instance of Pearl's `belief propagation' algorithm (context) - McEliece, MacKay et al. - 1998

BibTeX entry:   (Update)

Dechter, R. 1997. Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. Constraints: An International Journal 2: 51--55. http://citeseer.ist.psu.edu/article/dechter98bucket.html   More

@article{ dechter96bucket,
    author = "R. Dechter",
    title = "Bucket elimination: a unifying framework for processing hard and soft constraints",
    journal = "ACM Computing Surveys",
    volume = "28",
    number = "4es",
    pages = "61--61",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/dechter98bucket.html" }
Citations (may not include all citations):
760   Probabilistic Reasoning in Intelligent Systems (context) - Pearl - 1988
307   Networks of constraints: Fundamental properties and applicat.. (context) - Montanari - 1974
211   Enhancement schemes for constraint processing: Backjumping (context) - Dechter - 1990
186   Constraint satisfaction (context) - Mackworth - 1992
185   A sufficient condition for backtrack-free search (context) - Freuder - 1982
132   Bucket elimination: A unifying framework for probabilistic i.. - Dechter - 1996
61   Directional resolution: The davis-putnam procedure - Dechter, Rish - 1994
29   Encyclopedia of Artificial Intelligence (context) - Dechter - 1992
13   Local and global relational consistency - Dechter, van Beek - 1995

Documents on the same site (http://www.ics.uci.edu/pub/CSP-repository/papers/):   More
Propositional Semantics for Disjunctive Logic Programs - Ben-Eliyahu, Dechter (1994)   (Correct)
Local and Global Relational Consistency - Dechter, van Beek (1995)   (Correct)
Topological Parameters for time-space tradeoff (extended abstract) - Dechter (1996)   (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