116 search results - page 6 / 24 » On the solution-space geometry of random constraint satisfac... |
AAAI
1994
14 years 10 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
103
click to vote
AI
2008
Springer
14 years 9 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
CSCLP
2005
Springer
15 years 3 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
FLAIRS
2007
14 years 11 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...