Search Results for author:
Found 2 papers, 2 papers with code
Plus Strategies are Exponentially Slower for Planted Optima of Random Height
We compare the $(1,\lambda)$-EA and the $(1 + \lambda)$-EA on the recently introduced benchmark DisOM, which is the OneMax function with randomly planted local optima.
Hardest Monotone Functions for Evolutionary Algorithms
Recently, Kaufmann, Larcher, Lengler and Zou conjectured that for the self-adjusting $(1,\lambda)$-EA, Adversarial Dynamic BinVal (ADBV) is the hardest dynamic monotone function to optimize.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
