714 search results - page 29 / 143 » Lexicographically-ordered constraint satisfaction problems |
130
click to vote
WLP
2004
Springer
15 years 6 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
111
click to vote
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
161
click to vote
IJCAI
1989
15 years 2 months ago
1989
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
IPL
2000
15 years 1 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
121
click to vote
IJCAI
2003
15 years 2 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...