55 search results - page 6 / 11 » cp 2003 |
CP
2003
Springer
14 years 25 days 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...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...
CP
2003
Springer
14 years 25 days ago
2003
Springer
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The ...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
CP
2003
Springer
14 years 25 days ago
2003
Springer
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...