73 search results - page 1 / 15 » A Landscape Analysis of Constraint Satisfaction Problems |
CORR
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2007
Springer
13 years 11 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
AAAI
1996
14 years 12 days 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...