596 search results - page 6 / 120 » Search Strategies for Hybrid Search Spaces |
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noisy testbed. The CMAEGS is a hybrid strategy which combines elements from gradient search an...
ICTAI
1999
IEEE
13 years 12 months ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
CCGRID
2004
IEEE
13 years 11 months ago
2004
IEEE
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...
DAM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
HM
2009
Springer
14 years 7 days 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++ )....