150 search results - page 29 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
165
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
153
click to vote
CP
1998
Springer
15 years 10 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
203
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
164
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
181
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...