711 search results - page 45 / 143 » Amalgams of Constraint Satisfaction Problems |
115
click to vote
CP
2006
Springer
15 years 3 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
14 years 11 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
15 years 4 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 ...
IVC
2002
14 years 11 months ago
2002
The problem of image segmentation using constraint satisfaction neural networks (CSNN) has been considered. Several variations of the CSNN theme have been advanced to improve its ...
CP
2001
Springer
15 years 4 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...