434 search results - page 23 / 87 » Constraint-Based Combinators for Local Search |
147
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
149
click to vote
SC
2005
ACM
15 years 10 months ago
2005
ACM
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
149
click to vote
CLEF
2004
Springer
15 years 10 months ago
2004
Springer
We describe our experiments for the Image CLEF medical retrieval task. Our efforts were focused on the initial visual search. A content based approach was followed. We used textur...
157
Voted
CP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
169
click to vote
AIMSA
2008
Springer
15 years 7 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...