198 search results - page 27 / 40 » Colouring, constraint satisfaction, and complexity |
95
Voted
AI
2008
Springer
14 years 9 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...
TCS
2008
14 years 9 months ago
2008
Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...
STACS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
174
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...