Sciweavers

Share
GECCO
2009
Springer

Benchmarking the pure random search on the BBOB-2009 testbed

10 years 7 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 dimension. The maximum number of function evaluations chosen is 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed. Categories and Subject Descriptors
Anne Auger, Raymond Ros
Added 24 Jul 2010
Updated 24 Jul 2010
Type Conference
Year 2009
Where GECCO
Authors Anne Auger, Raymond Ros
Comments (0)
books