| Publication | Date of Publication | Type |
|---|
Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function
Algorithmica | 2024-08-02 | Paper |
Runtime Analysis of a Co-Evolutionary Algorithm
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2024-02-23 | Paper |
Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2024-02-23 | Paper |
More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
Algorithmica | 2024-01-25 | Paper |
Tail bounds on hitting times of randomized search heuristics using variable drift analysis
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
Algorithmica | 2021-11-05 | Paper |
On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
Level-based analysis of the univariate marginal distribution algorithm
Algorithmica | 2019-02-14 | Paper |
A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Non-uniform mutation rates for problems with unknown solution lengths
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Populations can be essential in tracking dynamic optima
Algorithmica | 2017-07-07 | Paper |
Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
Black-box Complexity of Parallel Search with Distributed Populations
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
Runtime analysis of non-elitist populations: from classical optimisation to partial information
Algorithmica | 2016-08-31 | Paper |
Toward a unifying framework for evolutionary processes
Journal of Theoretical Biology | 2016-08-18 | Paper |
Runtime analysis of the \((1+1)\) EA on computing unique input output sequences
Information Sciences | 2016-01-14 | Paper |
Concentrated hitting times of randomized search heuristics with variable drift
Algorithms and Computation | 2015-09-11 | Paper |
Black-box search by unbiased variation
Algorithmica | 2013-04-03 | Paper |
Crossover can be constructive when computing unique input-output sequences
Soft Computing | 2012-05-10 | Paper |
