19 citations · 95 across the 21 of their papers we have counts for
5 papers · 1 filter
Runtime Analysis of a Heavy-Tailed Genetic Algorithm on Jump Functions
Denis Antipov, Benjamin Doerr
It was recently observed that the genetic algorithm can comparably easily escape the local optimum of the jump functions benchmark. Consequently, this algorithm can opt…
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…
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…
A Rigorous Runtime Analysis of the GA on Jump Functions
Denis Antipov, Benjamin Doerr, Vitalii Karavaev
The genetic algorithm is a younger evolutionary algorithm trying to profit also from inferior solutions. Rigorous runtime analyses on unimodal fitness functions showe…
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…