Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Mutation Rate Matters Even When Optimizing Monotonic Functions

Evolutionary Computation (2013) 21 (1): 1–27.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Large population sizes and crossover help in dynamic environments
  • Johannes Lengler
  • Jonas Meier
Natural Computing (2024) 23 (1): 115.
Runtime Analysis of Quality Diversity Algorithms
  • Jakob Bossek
  • Dirk Sudholt
Algorithmica (2024) 86 (10): 3252.
Self-adjusting population sizes for the (1,λ)-EA on monotone functions
  • Marc Kaufmann
  • Maxime Larcher
  • Johannes Lengler
  • Xun Zou
Theoretical Computer Science (2023) 979: 114181.
Evolutionary Algorithms for Parameter Optimization—Thirty Years Later
  • Thomas H. W. Bäck
  • Anna V. Kononova
  • Bas van Stein
  • Hao Wang
  • Kirill A. Antonov
  • Roman T. Kalkreuth
  • Jacob de Nobel
  • Diederick Vermetten
  • Roy de Winter
  • Furong Ye
Evolutionary Computation (2023) 31 (2): 81.
Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard
  • Duri Janett
  • Johannes Lengler
Theoretical Computer Science (2023) 971: 114072.
Do additional target points speed up evolutionary algorithms?
  • Jakob Bossek
  • Dirk Sudholt
Theoretical Computer Science (2023) 950: 113757.
Fast Mutation in Crossover-Based Algorithms
  • Denis Antipov
  • Maxim Buzdalov
  • Benjamin Doerr
Algorithmica (2022) 84 (6): 1724.
Runtime Analysis of the $$(\mu + 1)$$-EA on the Dynamic BinVal Function
  • Johannes Lengler
  • Simone Riedi
SN Computer Science (2022) 3 (4)
Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions
  • Johannes Lengler
  • Xun Zou
Theoretical Computer Science (2021) 875: 28.
Runtime Analysis for Self-adaptive Mutation Rates
  • Benjamin Doerr
  • Carsten Witt
  • Jing Yang
Algorithmica (2021) 83 (4): 1012.
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
  • Francesco Quinzan
  • Andreas Göbel
  • Markus Wagner
  • Tobias Friedrich
Natural Computing (2021) 20 (3): 561.
Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial
  • Dirk Sudholt
Algorithmica (2021) 83 (4): 976.
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization
  • Benjamin Doerr
  • Frank Neumann
ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (4): 1.
Precise Runtime Analysis for Plateau Functions
  • Denis Antipov
  • Benjamin Doerr
ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (4): 1.
Exponential upper bounds for the runtime of randomized search heuristics
  • Benjamin Doerr
Theoretical Computer Science (2021) 851: 24.
A Tight Runtime Analysis for the $${(\mu + \lambda )}$$ EA
  • Denis Antipov
  • Benjamin Doerr
Algorithmica (2021) 83 (4): 1054.
Self-Adaptation in Nonelitist Evolutionary Algorithms on Discrete Problems With Unknown Structure
  • Brendan Case
  • Per Kristian Lehre
IEEE Transactions on Evolutionary Computation (2020) 24 (4): 650.
Parallel Black-Box Complexity With Tail Bounds
  • Per Kristian Lehre
  • Dirk Sudholt
IEEE Transactions on Evolutionary Computation (2020) 24 (6): 1010.
Optimal parameter choices via precise black-box analysis
  • Benjamin Doerr
  • Carola Doerr
  • Jing Yang
Theoretical Computer Science (2020) 801: 1.
A General Dichotomy of Evolutionary Algorithms on Monotone Functions
  • Johannes Lengler
IEEE Transactions on Evolutionary Computation (2020) 24 (6): 995.
Markov chain analysis of evolutionary algorithms for monotonic functions
  • QinLian Ma
  • Yu-an Zhang
  • Kunihito Yamamori
  • Hiroshi Furutani
  • Satoru Hiwa
  • Tomoyuki Hiroyasu
Artificial Life and Robotics (2019) 24 (1): 82.
Optimal Static and Self-Adjusting Parameter Choices for the $$(1+(\lambda ,\lambda ))$$ ( 1 + ( λ , λ ) ) Genetic Algorithm
  • Benjamin Doerr
  • Carola Doerr
Algorithmica (2018) 80 (5): 1658.
Drift Analysis and Evolutionary Algorithms Revisited
  • J. LENGLER
  • A. STEGER
Combinatorics, Probability and Computing (2018) 27 (4): 643.
Improved Evolutionary Algorithm Design for the Project Scheduling Problem Based on Runtime Analysis
  • Leandro L. Minku
  • Dirk Sudholt
  • Xin Yao
IEEE Transactions on Software Engineering (2014) 40 (1): 83.

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2024 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept