1300 search results - page 105 / 260 » Constraint satisfaction problems and global cardinality cons... |
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
AI
2008
Springer
14 years 10 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
AI
2003
Springer
15 years 3 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
116
click to vote
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...