1 citations · 1 across the 5 of their papers we have counts for
Showing cs.NEShow all
3 papers · 1 filter
cs.NE2023
Hardest Monotone Functions for Evolutionary Algorithms
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
In this paper we revisit the question how hard it can be for the Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic sto…
cs.NE2022
OneMax is not the Easiest Function for Fitness Improvements
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
We study the success rule for controlling the population size of the -EA. It was shown by Hevia Fajardo and Sudholt that this parameter control mechanism can run i…
cs.NE2022
Self-adjusting Population Sizes for the -EA on Monotone Functions
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
We study the -EA with mutation rate for , where the population size is adaptively controlled with the -success rule. Recently, Hevia Fajardo and Sudho…