99 search results - page 14 / 20 » Search Techniques for Non-linear Constraint Satisfaction Pro... |
AISC
2008
Springer
13 years 8 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
CONSTRAINTS
2007
13 years 6 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
CSCLP
2006
Springer
13 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
GECCO
2007
Springer
14 years 27 days ago
2007
Springer
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
CP
2003
Springer
13 years 12 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...