#### Filter Results:

- Full text PDF available (53)

#### Publication Year

2005

2017

- This year (7)
- Last 5 years (55)
- Last 10 years (74)

#### 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, Daniel Johannsen, Carola Doerr
- IEEE Congress on Evolutionary Computation
- 2010

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

- Armand Abulencia, Darin Acosta, +164 authors Sergio Grinstein
- 2006

A. Abulencia, D. Acosta, J. Adelman, T. Affolder, T. Akimoto, M. G. Albrow, D. Ambrose, S. Amerio, D. Amidei, A. Anastassov, K. Anikeev, A. Annovi, J. Antos, M. Aoki, G. Apollinari, J.-F. Arguin, T. Arisawa, A. Artikov, W. Ashmanskas, A. Attal, F. Azfar, P. Azzi-Bacchetta, P. Azzurri, N. Bacchetta, H. Bachacou, W. Badgett, A. Barbaro-Galtieri, V. E. Barnes,… (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)

- 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, Anand Srivastav, Carola Doerr
- J. Complexity
- 2009

The well-known star discrepancy is a common measure for the uniformity of point distributions. It is used, e.g., in multivariate integration, pseudo random number generation, experimental design, statistics, or computer graphics. We study here the complexity of calculating the star discrepancy of point sets in the d-dimensional unit cube and show that this… (More)

- Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Doerr, Christine Zarges
- Evolutionary Computation
- 2013

Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotonic. These functions have the property that whenever only 0-bits are changed to 1, then the objective value strictly increases. Contrary to what one would expect, not all of… (More)

- 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)

Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these functions are easy to optimize. The choice of the constant c in the mutation probability p(n) = c/n can make a… (More)