1300 search results - page 17 / 260 » Constraint satisfaction problems and global cardinality cons... |
78
Voted
STOC
2005
ACM
15 years 10 months ago
2005
ACM
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
AIR
2005
14 years 9 months ago
2005
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
68
Voted
DAGSTUHL
2008
14 years 11 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...