206 search results - page 8 / 42 » Random backtracking in backtrack search algorithms for satis... |
CONSTRAINTS
2006
13 years 8 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
AAAI
1996
13 years 9 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
AAAI
1997
13 years 9 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
CP
2006
Springer
14 years 4 days 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...