858 search results - page 67 / 172 » A Glimpse of Constraint Satisfaction |
161
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
169
click to vote
CP
2004
Springer
16 years 5 days ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
166
Voted
IAT
2003
IEEE
16 years 1 days ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
161
click to vote
CP
2003
Springer
16 years 1 hour ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
213
Voted
CP
2011
Springer
14 years 6 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...