#### Filter Results:

- Full text PDF available (36)

#### Publication Year

2009

2017

- This year (7)
- Last 5 years (50)
- Last 10 years (63)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Benjamin Doerr, Daniel Johannsen, Carola Doerr
- Algorithmica
- 2010

Drift analysis is one of the strongest tools in the analysis of evolutionary algorithms. Its main weakness is that it is often very hard to find a good drift function.
In this paper, we make progress in this direction. We prove a multiplicative version of the classical drift theorem. This allows easier analyses in those settings, where the optimization… (More)

- Benjamin Doerr, Carola Doerr, Franziska Ebel
- Theor. Comput. Sci.
- 2015

- Benjamin Doerr, Daniel Johannsen, Carola Doerr
- IEEE Congress on Evolutionary Computation
- 2010

- Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Doerr
- CTW
- 2012

We analyze the general version of the classic guessing game Mastermind with <i>n</i> positions and <i>k</i> colors. Since the case <i>k</i> ≤ <i>n</i><sup>1 − ϵ</sup>, ϵ > 0 a constant, is well understood, we concentrate on larger numbers of colors. For the most prominent case <i>k</i> = <i>n</i>, our results imply that… (More)

- Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
- Space-Efficient Data Structures, Streams, and…
- 2013

We study the query complexity of determining a hidden permutation. More specifically, we study the problem of learning a secret (z, π) consisting of a binary string z of length n and a permutation π of [n]. The secret must be unveiled by asking queries x ∈ {0, 1} n , and for each query asked, we are returned the score f z,π (x) defined as f z,π (x) := max{i… (More)

- Benjamin Doerr, Carola Doerr, Franziska Ebel
- GECCO
- 2013

The recently active research area of black-box complexity revealed that for many optimization problems the best possible black-box optimization algorithm is significantly faster than all known evolutionary approaches. While it is not to be expected that a general-purpose heuristic competes with a problem-tailored algorithm, it still makes sense to look for… (More)

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 operators the black-box complexity of LeadingOnes drops from Θ(<i>n</i><sup>2</sup>) for unary operators to <i>O</i>(<i>n</i> log <i>n</i>). For OneMax, the Ω(<i>n</i> log… (More)

- Benjamin Doerr, Carola Doerr
- Theory of Computing Systems
- 2012

We analyze the classic board game of Mastermind with n holes and a constant number of colors. The classic result of Chvátal (Combinatorica 3:325–329, 1983) states that the codebreaker can find the secret code with Θ(n/logn) questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In… (More)

- Benjamin Doerr, Carola Doerr
- GECCO
- 2015

While evolutionary algorithms are known to be very successful for a broad range of applications, the algorithm designer is often left with many algorithmic choices, for example, the size of the population, the mutation rates, and the crossover rates of the algorithm. These parameters are known to have a crucial influence on the optimization time, and thus… (More)

- Michael Gnewuch, Magnus Wahlström, Carola Doerr
- SIAM J. Numerical Analysis
- 2012

We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028–2042] it is based on the optimization algorithm threshold accepting. Our improvements include, amongst others, a non-uniform sampling strategy which is more… (More)