65 citations · 151 across the 17 of their papers we have counts for
5 papers · 1 filter
Optimal Mutation Rates for the EA on OneMax
Maxim Buzdalov, Carola Doerr
The OneMax problem, alternatively known as the Hamming distance problem, is often referred to as the "drosophila of evolutionary computation (EC)", because of its high relevance in…
First Steps Towards a Runtime Analysis When Starting With a Good Solution
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
The mathematical runtime analysis of evolutionary algorithms traditionally regards the time an algorithm needs to find a solution of a certain quality when initialized with a rando…
The Genetic Algorithm for Permutations
Anton Bassin, Maxim Buzdalov
The genetic algorithm is a bright example of an evolutionary algorithm which was developed based on the insights from theoretical findings. This algorithm uses crossove…
Fixed-Target Runtime Analysis
Maxim Buzdalov, Benjamin Doerr, Carola Doerr +1
Runtime analysis aims at contributing to our understanding of evolutionary algorithms through mathematical analyses of their runtimes. In the context of discrete optimization probl…
Fast Mutation in Crossover-based Algorithms
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
The heavy-tailed mutation operator proposed in Doerr, Le, Makhmara, and Nguyen (GECCO 2017), called \emph{fast mutation} to agree with the previously used language, so far was prov…