5 search results - page 1 / 1 » Mini-bucket Elimination with Bucket Propagation |
IJCAI
1997
13 years 6 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...
AAAI
2010
13 years 6 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...