Skip to Main Content

Advertisement

Umbrella Alt Text
header search
Search
Advanced Search
Skip Nav Destination

Rigorous Hitting Times for Binary Mutations

Evolutionary Computation (1999) 7 (2): 173–203.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
  • Henry Bambury
  • Antoine Bultel
  • Benjamin Doerr
Algorithmica (2022)
Does Comma Selection Help to Cope with Local Optima?
  • Benjamin Doerr
Algorithmica (2022) 84 (6): 1659.
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
  • Amirhossein Rajabi
  • Carsten Witt
Algorithmica (2022) 84 (6): 1694.
Lower Bounds from Fitness Levels Made Easy
  • Benjamin Doerr
  • Timo Kötzing
Algorithmica (2022)
Fast Mutation in Crossover-Based Algorithms
  • Denis Antipov
  • Maxim Buzdalov
  • Benjamin Doerr
Algorithmica (2022) 84 (6): 1724.
Exponential upper bounds for the runtime of randomized search heuristics
  • Benjamin Doerr
Theoretical Computer Science (2021) 851: 24.
Precise Runtime Analysis for Plateau Functions
  • Denis Antipov
  • Benjamin Doerr
ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (4): 1.
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.
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
  • Moritz Mühlenthaler
  • Alexander Raß
  • Manuel Schmitt
  • Rolf Wanka
Natural Computing (2021)
Optimal parameter choices via precise black-box analysis
  • Benjamin Doerr
  • Carola Doerr
  • Jing Yang
Theoretical Computer Science (2020) 801: 1.
Benchmarking discrete optimization heuristics with IOHprofiler
  • Carola Doerr
  • Furong Ye
  • Naama Horesh
  • Hao Wang
  • Ofer M. Shir
  • Thomas Bäck
Applied Soft Computing (2020) 88: 106027.
The ( $$1+\lambda $$ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation Rate
  • Benjamin Doerr
  • Christian Gießen
  • Carsten Witt
  • Jing Yang
Algorithmica (2019) 81 (2): 593.
Analyzing randomized search heuristics via stochastic domination
  • Benjamin Doerr
Theoretical Computer Science (2019) 773: 115.
Modelling Evolutionary Algorithms with Stochastic Differential Equations
  • Jorge Pérez Heredia
Evolutionary Computation (2018) 26 (4): 657.
Probabilistic Analysis of the (1+1)-Evolutionary Algorithm
  • Hsien-Kuei Hwang
  • Alois Panholzer
  • Nicolas Rolin
  • Tsung-Hsi Tsai
  • Wei-Mei Chen
Evolutionary Computation (2018) 26 (2): 299.
The time complexity analysis of a class of gene expression programming
  • Xin Du
  • Youcong Ni
  • Datong Xie
  • Xin Yao
  • Peng Ye
  • Ruliang Xiao
Soft Computing (2015) 19 (6): 1611.
Fitness Probability Distribution of Bit-Flip Mutation
  • Francisco Chicano
  • Andrew M. Sutton
  • L. Darrell Whitley
  • Enrique Alba
Evolutionary Computation (2015) 23 (2): 217.
Evolutionary Algorithms for Quantum Computers
  • Daniel Johannsen
  • Piyush P. Kurur
  • Johannes Lengler
Algorithmica (2014) 68 (1): 152.
Some techniques for analyzing time complexity of evolutionary algorithms
  • Lixin Ding
  • Jinghu Yu
Transactions of the Institute of Measurement and Control (2012) 34 (6): 755.
The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSAT problems
  • Xinsheng Lai
  • Yuren Zhou
Journal of Global Optimization (2012) 54 (4): 745.
Analysis on the Collaboration Between Global Search and Local Search in Memetic Computation
  • Jih-Yiing Lin
  • Ying-Ping Chen
IEEE Transactions on Evolutionary Computation (2011) 15 (5): 608.
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
  • Pietro S. Oliveto
  • Carsten Witt
Algorithmica (2011) 59 (3): 369.
Finding Mount Everest and Handling Voids
  • Tobias Storch
Evolutionary Computation (2011) 19 (2): 325.
Estimation of distribution algorithms on non-separable problems
  • Alexandru Agapie
International Journal of Computer Mathematics (2010) 87 (3): 491.
When to use bit-wise neutrality
  • Tobias Friedrich
  • Frank Neumann
Natural Computing (2010) 9 (1): 283.
Choosing selection pressure for wide-gap problems
  • Tianshi Chen
  • Jun He
  • Guoliang Chen
  • Xin Yao
Theoretical Computer Science (2010) 411 (6): 926.
Analysis of an Asymmetric Mutation Operator
  • Thomas Jansen
  • Dirk Sudholt
Evolutionary Computation (2010) 18 (1): 1.
Stability in the Self-Organized Evolution of Networks
  • Madeleine Theile
  • Thomas Jansen
Algorithmica (2010) 57 (1): 147.
A comparative runtime analysis of heuristic algorithms for satisfiability problems
  • Yuren Zhou
  • Jun He
  • Qing Nie
Artificial Intelligence (2009) 173 (2): 240.
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus
  • Frank Neumann
  • Dirk Sudholt
  • Carsten Witt
Swarm Intelligence (2009) 3 (1): 35.
A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) (2009) 39 (5): 1092.
A Pheromone-Rate-Based Analysis on the Convergence Time of ACO Algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) (2009) 39 (4): 910.
Preserving and Exploiting Genetic Diversity in Evolutionary Programming Algorithms
  • Gang Chen
  • Chor Ping Low
  • Zhonghua Yang
IEEE Transactions on Evolutionary Computation (2009) 13 (3): 661.
Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization
  • Xin Yu
  • Ke Tang
  • Tianshi Chen
  • Xin Yao
Memetic Computing (2009) 1 (1): 3.
Scaling of program functionality
  • W. B. Langdon
Genetic Programming and Evolvable Machines (2009) 10 (1): 5.
A new approach to estimating the expected first hitting time of evolutionary algorithms
  • Yang Yu
  • Zhi-Hua Zhou
Artificial Intelligence (2008) 172 (15): 1809.
Population size versus runtime of a simple evolutionary algorithm
  • Carsten Witt
Theoretical Computer Science (2008) 403 (1): 104.
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation
  • Thomas Jansen
  • Ingo Wegener
Theoretical Computer Science (2007) 386 (1-2): 73.
A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems
  • Yuren Zhou
  • Jun He
IEEE Transactions on Evolutionary Computation (2007) 11 (5): 608.
Transition Functions for Evolutionary Algorithms on Continuous State-space
  • Alexandru Agapie
  • Mircea Agapie
Journal of Mathematical Modelling and Algorithms (2007) 6 (2): 297.
Recent Advances in Evolutionary Computation
  • Xin Yao
  • Yong Xu
Journal of Computer Science and Technology (2006) 21 (1): 1.
On the analysis of a dynamic evolutionary algorithm
  • Thomas Jansen
  • Ingo Wegener
Journal of Discrete Algorithms (2006) 4 (1): 181.
Analysis of a Multiobjective Evolutionary Algorithm on the 0–1 knapsack problem
  • Rajeev Kumar
  • Nilanjan Banerjee
Theoretical Computer Science (2006) 358 (1): 104.
Runtime Analysis of the (μ + 1) EA on Simple Pseudo-Boolean Functions
  • Carsten Witt
Evolutionary Computation (2006) 14 (1): 65.
On the impact of objective function transformations on evolutionary and black-box algorithms
  • Tobias Storch
Genetic Programming and Evolvable Machines (2006) 7 (2): 171.
Bounds for probability of success of classical genetic algorithm based on hamming distance
  • B.K.S. Cheung
IEEE Transactions on Evolutionary Computation (2006) 10 (1): 1.
Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
  • Véronique Ladret
Journal of Applied Probability (2005) 42 (01): 39.
Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
  • Véronique Ladret
Journal of Applied Probability (2005) 42 (1): 39.
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions
  • Ingo Wegener
  • Carsten Witt
Journal of Discrete Algorithms (2005) 3 (1): 61.
The Cooperative Coevolutionary (1+1) EA
  • Thomas Jansen
  • R. Paul Wiegand
Evolutionary Computation (2004) 12 (4): 405.

Advertisement

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

Browse

Resources

MIT Press Links

Contact Us

© 2022 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.
Accept