805 search results - page 27 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
ACG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
CP
2011
Springer
12 years 8 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
AAAI
2007
13 years 10 months ago
2007
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
IJDMB
2010
13 years 5 months ago
2010
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....