400 search results - page 75 / 80 » A Synthesis of Constraint Satisfaction and Constraint Solvin... |
ICCAD
1999
IEEE
13 years 12 months ago
1999
IEEE
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
ECP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
EVOW
2010
Springer
13 years 11 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
CP
1995
Springer
13 years 11 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
IJCAI
2003
13 years 9 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...