113 search results - page 3 / 23 » On bounded occurrence constraint satisfaction |
DAGSTUHL
2008
13 years 9 months ago
2008
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
AAAI
1996
13 years 9 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
AAAI
1996
13 years 9 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...