Search Results for author:
Found 2 papers, 0 papers with code
The Runtime of Random Local Search on the Generalized Needle Problem
In their recent work, C. Doerr and Krejca (Transactions on Evolutionary Computation, 2023) proved upper bounds on the expected runtime of the randomized local search heuristic on generalized Needle functions.
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
We also use this method to analyze the runtime of the $(1+1)$ evolutionary algorithm on a new benchmark consisting of $n/\ell$ plateaus of effective size $2^\ell-1$ which have to be optimized sequentially in a LeadingOnes fashion.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
