Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms, 2018. ,
From black-box complexity to designing new genetic algorithms, Theoretical Computer Science, vol.567, pp.87-104, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01272858
Optimal Parameter Choices via Precise Black-Box Analysis, Proceedings of Genetic and Evolutionary Computation Conference, pp.1123-1130, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01363930
A method to derive fixed budget results from expected optimisation times, Proceedings of Genetic and Evolutionary Computation Conference, pp.1581-1588, 2013. ,
Fast genetic algorithms, Proceedings of Genetic and Evolutionary Computation Conference, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01797913
Performance analysis of randomised search heuristics operating with a fixed budget, Theoretical Computer Science, vol.545, pp.39-58, 2014. ,
Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective, IEEE Transactions on Evolutionary Computation, vol.18, pp.674-688, 2014. ,
Drift Analysis, 2017. ,
Fixed budget performance of the (1+1) EA on linear functions, Foundations of Genetic Algorithms XIII, pp.52-61, 2015. ,
Nevergrad -A gradient-free optimization platform, 2018. ,
Tight bounds on the optimization time of a randomized search heuristic on linear functions, Combinatorics, Probability and Computing, vol.22, pp.294-318, 2013. ,