1300 search results - page 61 / 260 » Constraint satisfaction problems and global cardinality cons... |
CP
2006
Springer
15 years 1 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...
143
click to vote
IJIT
2004
14 years 11 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
107
click to vote
AAAI
2006
14 years 11 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
AAAI
2007
15 years 3 days 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 ...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...