6 citations · 9 across the 3 of their papers we have counts for
4 papers
The Right Mutation Strength for Multi-Valued Decision Variables
Benjamin Doerr, Carola Doerr, Timo Kötzing
The most common representation in evolutionary computation are bit strings. This is ideal to model binary decision variables, but less useful for variables taking more values. With…
Solving Problems with Unknown Solution Length at (Almost) No Extra Cost
Benjamin Doerr, Carola Doerr, Timo Kötzing
Most research in the theory of evolutionary computation assumes that the problem at hand has a fixed problem size. This assumption does not always apply to real-world optimization…
The Benefit of Sex in Noisy Evolutionary Search
Tobias Friedrich, Timo Kötzing, Martin Krejca +1
The benefit of sexual recombination is one of the most fundamental questions both in population genetics and evolutionary computation. It is widely believed that recombination help…
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…