Sciweavers

17967 search results - page 102 / 3594
» Functional timing optimization
Sort
View
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
14 years 22 days 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
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
14 years 22 days ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
Anne Auger, Raymond Ros
GECCO
2009
Springer
122views Optimization» more  GECCO 2009»
13 years 12 months ago
Visualising random boolean network dynamics
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
Susan Stepney
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 2 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek