Multiplicative Drift Analysis
- Benjamin Doerr, Daniel Johannsen, Carola Doerr
- Computer Science, MathematicsAnnual Conference on Genetic and Evolutionary…
- 7 July 2010
This work introduces multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms and demonstrates how it immediately gives natural proofs for the best known runtime bounds for the (1+1) Evolutionary Algorithm on combinatorial problems like finding minimum spanning trees, shortest paths, or Euler tours in graphs.
Fast genetic algorithms
- Benjamin Doerr, H. P. Le, Régis Makhmara, T. Nguyen
- Computer Science, MathematicsAnnual Conference on Genetic and Evolutionary…
- 9 March 2017
This work proposes a random mutation rate α/n, where α is chosen from a power-law distribution and proves that the (1 + 1) EA with this heavy-tailed mutation rate optimizes any Jumpm, n function in a time that is only a small polynomial factor above the one stemming from the optimal rate for this m.
Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem
- Süntje Böttcher, Benjamin Doerr, F. Neumann
- Computer Science, MathematicsParallel Problem Solving from Nature
- 11 September 2010
We reconsider a classical problem, namely how the (1+1) evolutionary algorithm optimizes the LEADINGONES function. We prove that if a mutation probability of p is used and the problem size is n, then…
Theory of Randomized Search Heuristics: Foundations and Recent Developments
- A. Auger, Benjamin Doerr
- Computer ScienceTheory of Randomized Search Heuristics
- 16 February 2011
This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence.
From black-box complexity to designing new genetic algorithms
- Benjamin Doerr, Carola Doerr, Franziska Ebel
- Computer ScienceTheoretical Computer Science
- 16 February 2015
Social networks spread rumors in sublogarithmic time
- Benjamin Doerr, M. Fouz, T. Friedrich
- Computer ScienceSymposium on the Theory of Computing
- 6 June 2011
This work studies the performance of randomized rumor spreading protocols on graphs in the preferential attachment model and proves the first time that a sublogarithmic broadcast time is proven for a natural setting.
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings
- Benjamin Doerr, Carola Doerr
- Computer ScienceAnnual Conference on Genetic and Evolutionary…
- 13 April 2015
It is proved that if its population size is chosen according to the one-fifth success rule then the expected optimization time on OneMax is linear, better than what any static population size λ can achieve and is asymptotically optimal also among all adaptive parameter choices.
Stabilizing consensus with the power of two choices
- Benjamin Doerr, L. A. Goldberg, Lorenz Minder, Thomas Sauerwald, C. Scheideler
- Mathematics, Computer ScienceACM Symposium on Parallelism in Algorithms and…
- 4 June 2011
The main result is a simple randomized algorithm called median rule that, with high probability, just needs O(log m log log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most √n processes at any time.
Why rumors spread so quickly in social networks
- Benjamin Doerr, M. Fouz, T. Friedrich
- BusinessCommunications of the ACM
- 1 June 2012
A few hubs with many connections share with many individuals with few connections, leading to a chain of relationships that is mutually beneficial to both parties.
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
- Markus Mainberger, Sebastian Hoffmann, Benjamin Doerr
- MathematicsScale Space and Variational Methods in Computer…
- 29 May 2011
This paper optimise the spatial as well as the tonal data such that an image can be reconstructed with minimised error by means of discrete homogeneous diffusion inpainting by applying a probabilistic data sparsification followed by a nonlocal pixel exchange.
...
...