346 search results - page 16 / 70 » Solving quantified constraint satisfaction problems |
148
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
170
click to vote
AI
2001
Springer
15 years 10 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
187
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
208
click to vote
PACT
1999
Springer
15 years 10 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
176
click to vote
AI
2005
Springer
15 years 5 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...