749 search results - page 66 / 150 » Dualities for Constraint Satisfaction Problems |
109
click to vote
STACS
2010
Springer
15 years 4 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...
70
Voted
IJCAI
2001
15 years 13 days ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
CP
2009
Springer
15 years 5 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
SARA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
AAAI
1997
15 years 12 days ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...