Sciweavers

3514 search results - page 37 / 703
» A search space
Sort
View
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...
Anne Auger, Nikolaus Hansen
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
13 years 10 days ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
IADIS
2004
13 years 10 months ago
Relevant information retrieval for cooperative Web architecture
We describe an approach for constructing search spaces that consist of highly relevant web pages using similarities between the contents of linked web pages to represent their lin...
Aki Kobayashi, Kuangmin Tan, Katsunori Yamaoka, Yo...
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the pure random search on the BBOB-2009 testbed
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
Anne Auger, Raymond Ros