Fetching the paper…
Reading the bibliography…
We present a budget-free experimental setup and procedure for benchmarking numericaloptimization algorithms in a black-box scenario.
H.H. Hoos and T. Stützle. Evaluating Las Vegas algorithms: pitfalls and remedies. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98) , pages 238-245, 1998
1998
Earlier work this paper cites.
G.R. Harik and F.G. Lobo. A parameter-less genetic algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) , volume 1, pages 258-265. ACM, 1999
1999
Earlier work this paper cites.
A. Auger and N. Hansen. A restart CMA evolution strategy with increasing population size. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2005) , pages 1769–1776. IEEE Press, 2005
2005
Earlier work this paper cites.
N. Hansen, A. Auger, S. Finck, and R. Ros. Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup, Inria Research Report RR-6828 http://hal.inria.fr/inria-00362649/en , 2009
2009
Cited alongside, same era.
N. Hansen, A. Auger, S. Finck, and R. Ros. Real-Parameter Black-Box Optimization Benchmarking 2010: Experimental Setup, Inria Research Report RR-7215 http://hal.inria.fr/inria-00362649/en , 2010
2010
Cited alongside, same era.
2016
Closest in time.
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…