8 search results - page 1 / 2 » Bucket Elimination: A Unifying Framework for Reasoning |
108
click to vote
AI
1999
Springer
15 years 13 days ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
80
Voted
UAI
1996
15 years 2 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
71
Voted
AI
2005
Springer
15 years 20 days ago
2005
Springer
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
115
click to vote
IJCAI
1997
15 years 2 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
128
Voted
UAI
1997
15 years 2 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...