(Enter summary)
Abstract: Many problems in Artificial Intelligence, such as diagnosis,
control, and planning, can be framed as constraint optimization problems
where a limited number of leading solutions are needed. An important
class of optimization algorithms use A*, a variant of best first search, to
guide the search e#ectively, while employing a heuristic evaluation function
that is computed using dynamic programming. A key bottleneck,
however, is that significant e#ort can be wasted precomputing bounds
that... (Update)
Cited by: More
Diagnosis as Semiring-based Constraint Optimization - Sachenbacher, Williams (2004)
(Correct)
Active bibliography (related documents): More All
1.2: On-Demand Bound Computation for Best-First Constraint.. - Sachenbacher, Williams (2004)
(Correct)
0.3: Boosting Search with Variable Elimination in Constraint.. - Larrosa, Dechter (2002)
(Correct)
0.2: A General Scheme for Multiple Lower Bound Computation in.. - Dechter, Kask, Larrosa (2001)
(Correct)
Similar documents based on text: More All
0.2: An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004)
(Correct)
0.1: Automated Determination of Qualitative Distinctions.. - Sachenbacher, Struss (2000)
(Correct)
0.1: Generative Temporal Planning with Complex Processes - Kennell (2003)
(Correct)
BibTeX entry: (Update)
Martin Sachenbacher and Brian Williams, `On-demand bound computation for best-first constraint optimization'. Submitted to CP-2004. http://citeseer.comp.nus.edu.sg/711904.html More
@misc{ sachenbacher04demand,
author = "M. Sachenbacher and B. Williams",
title = "demand bound computation for best-first constraint optimization",
text = "Martin Sachenbacher and Brian Williams, `On-demand bound computation for
best-first constraint optimization'. Submitted to CP-2004.",
year = "2004",
url = "citeseer.comp.nus.edu.sg/711904.html" }
Citations (may not include all citations):
430
Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1996
141
Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
130
Models and Issues in Data Stream Systems (context) - Babcock - 2002
102
Semiring-based Constraint Solving and Optimization (context) - Bistarelli, Montanari et al. - 1997
95
Bucket elimination: A unifying framework for reasoning
- Dechter - 1999
45
A scheme for approximating probabilistic inference
- Dechter, Rish - 1997
44
Semiring-based CSPs and Valued CSPs: Frameworks (context) - Bistarelli - 1999
42
Generalized Best-First Search Strategies and the Optimality (context) - Dechter, Pearl - 1985
33
A comparison of structural CSP decomposition methods
- Gottlob, Leone et al. - 2000
19
Focusing on Probable Diagnoses (context) - de Kleer - 1991
15
Topological methods in cardinal utility theory (context) - Debreu - 1959
13
Russian doll search (context) - Verfaillie, Lematre et al. - 1996
12
Distributed Databases (context) - Ceri, Pelagatti - 1984
10
A General Scheme for Automatic Generation of Search Heuristi..
- Kask, Dechter - 2001
9
A General Scheme for Multiple Lower Bound Computation in Con..
- Dechter, Kask et al. - 2001
7
Unifying Tree-Decomposition Schemes for Automated Reasoning
- Kask - 2001
2
and its Role in Model-based Embedded Systems (context) - Williams, Ragno et al.
Documents on the same site (http://mers.csail.mit.edu/mers-publications.htm): More
Design of the Remote Agent Experiment for Spacecraft.. - Bernard, Dorais, Fry, .. (1998)
(Correct)
Model-based Reactive Programming of Cooperative.. - Williams, Kim.. (2001)
(Correct)
Decompositional, Model-based Learning and its Analogy to.. - Williams, Millar (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.