1300 search results - page 14 / 260 » Constraint satisfaction problems and global cardinality cons... |
103
click to vote
AAAI
2012
13 years 13 hour ago
2012
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
AI
2005
Springer
14 years 9 months ago
2005
Springer
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...
104
click to vote
CSR
2007
Springer
15 years 3 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
105
click to vote
WLP
2004
Springer
15 years 3 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)...
104
click to vote
FOCS
2008
IEEE
14 years 10 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...