434 search results - page 8 / 87 » Constraint-Based Combinators for Local Search |
HM
2009
Springer
15 years 4 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
ECAIW
2000
Springer
15 years 4 months ago
2000
Springer
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
FLAIRS
2004
15 years 1 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
105
click to vote
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...