191 search results - page 3 / 39 » Reformulating Constraint Satisfaction Problems to Improve Sc... |
138
Voted
AMC
2008
15 years 5 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
143
click to vote
SARA
2005
Springer
15 years 10 months ago
2005
Springer
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
153
click to vote
IJCAI
1993
15 years 6 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
144
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
157
click to vote
IJCAI
2003
15 years 6 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...