85 citations · 897 across the 89 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.NE2010
Faster Black-Box Algorithms Through Higher Arity Operators
Benjamin Doerr, Daniel Johannsen, Timo Kötzing +3
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary op…
cs.NE2010
Non-Existence of Linear Universal Drift Functions
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Drift analysis has become a powerful tool to prove bounds on the runtime of randomized search heuristics. It allows, for example, fairly simple proofs for the classical problem how…