942 search results - page 45 / 189 » Distance Constraint Satisfaction Problems |
CSL
2006
Springer
14 years 1 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
CONSTRAINTS
1998
13 years 9 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
CP
2006
Springer
14 years 1 months ago
2006
Springer
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
CAD
1999
Springer
13 years 9 months ago
1999
Springer
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
CP
2001
Springer
14 years 2 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...