2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.NE2024★ 2 cited
Plus Strategies are Exponentially Slower for Planted Optima of Random Height
Johannes Lengler, Leon Schiller, Oliver Sieberling
We compare the -EA and the -EA on the recently introduced benchmark DisOM, which is the OneMax function with randomly planted local optima. Previous work showed tha…
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…