99 search results - page 17 / 20 » Search Techniques for Non-linear Constraint Satisfaction Pro... |
CP
2008
Springer
14 years 11 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
SETN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
CP
2001
Springer
15 years 1 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
CSCLP
2004
Springer
15 years 2 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
ICLP
2004
Springer
15 years 2 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...