942 search results - page 110 / 189 » Distance Constraint Satisfaction Problems |
122
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
102
Voted
AAAI
2006
15 years 4 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
129
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
140
click to vote
FOCI
2007
IEEE
15 years 9 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
131
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...