1381 search results - page 13 / 277 » Computational Complexity of Constraint Satisfaction |
AISC
2004
Springer
14 years 3 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
CONSTRAINTS
2010
13 years 7 months ago
2010
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
RSA
2006
13 years 9 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
IJCAI
2003
13 years 11 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...