749 search results - page 51 / 150 » Dualities for Constraint Satisfaction Problems |
CP
2006
Springer
15 years 2 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...
ADHOCNOW
2008
Springer
15 years 5 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
112
click to vote
AAAI
2006
15 years 11 days 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 1 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 ...
101
click to vote
LICS
2010
IEEE
14 years 9 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...