330 search results - page 14 / 66 » Diagnosing and Solving Over-Determined Constraint Satisfacti... |
CAD
1999
Springer
13 years 7 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
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
CSUR
2000
13 years 7 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
DSOM
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
CEC
2009
IEEE
13 years 12 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...