Search Results for author:
Found 3 papers, 1 papers with code
Fast Re-Optimization of LeadingOnes with Frequent Changes
In this work, we first show that the re-optimization approach suggested by Doerr et al. reaches a limit when the problem instances are prone to more frequent changes.
Black-Box Complexity of the Binary Value Function
The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions.
Better Fixed-Arity Unbiased Black-Box Algorithms
In their GECCO'12 paper, Doerr and Doerr proved that the $k$-ary unbiased black-box complexity of OneMax on $n$ bits is $O(n/k)$ for $2\le k\le O(\log n)$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
