Skip to Main Content

Advertisement

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

A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs

Evolutionary Computation (1998) 6 (2): 185–196.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Lower Bounds from Fitness Levels Made Easy
  • Benjamin Doerr
  • Timo Kötzing
Algorithmica (2024) 86 (2): 367.
Can Evolutionary Clustering Have Theoretical Guarantees?
  • Chao Qian
IEEE Transactions on Evolutionary Computation (2024) 28 (5): 1220.
Multi-Level Evolution for Robotic Design
  • Shelvin Chand
  • David Howard
Frontiers in Robotics and AI (2021) 8
Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
  • Chao Qian
  • Yang Yu
  • Ke Tang
  • Xin Yao
  • Zhi-Hua Zhou
Artificial Intelligence (2019) 275: 279.
Analyzing Evolutionary Optimization in Noisy Environments
  • Chao Qian
  • Yang Yu
  • Zhi-Hua Zhou
Evolutionary Computation (2018) 26 (1): 1.
Rigorous Running Time Analysis of a Simple Immune-Based Multi-Objective Optimizer for Bi-Objective Pseudo-Boolean Functions
  • Shiyuan Zhou
  • Xue Peng
  • Yinglin Wang
  • Xiaoyun Xia
Journal of Shanghai Jiaotong University (Science) (2018) 23 (6): 827.
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
  • Benjamin Doerr
  • Carola Doerr
Algorithmica (2016) 75 (3): 529.
Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem
  • Yuren Zhou
  • Xinsheng Lai
  • Kangshun Li
IEEE Transactions on Cybernetics (2015) 45 (8): 1491.
Switch Analysis for Running Time Analysis of Evolutionary Algorithms
  • Yang Yu
  • Chao Qian
  • Zhi-Hua Zhou
IEEE Transactions on Evolutionary Computation (2015) 19 (6): 777.
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
  • Dirk Sudholt
IEEE Transactions on Evolutionary Computation (2013) 17 (3): 418.
Adaptive Drift Analysis
  • Benjamin Doerr
  • Leslie Ann Goldberg
Algorithmica (2013) 65 (1): 224.
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.
On the approximation ability of evolutionary optimization with application to minimum set cover
  • Yang Yu
  • Xin Yao
  • Zhi-Hua Zhou
Artificial Intelligence (2012) 180-181: 20.
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
  • Hervé Fournier
  • Olivier Teytaud
Algorithmica (2011) 59 (3): 387.
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.
Theoretical results in genetic programming: the next ten years?
  • Riccardo Poli
  • Leonardo Vanneschi
  • William B. Langdon
  • Nicholas Freitag McPhee
Genetic Programming and Evolvable Machines (2010) 11 (3-4): 285.
When to use bit-wise neutrality
  • Tobias Friedrich
  • Frank Neumann
Natural Computing (2010) 9 (1): 283.
Practical performance models of algorithms in evolutionary program induction and other domains
  • Mario Graff
  • Riccardo Poli
Artificial Intelligence (2010) 174 (15): 1254.
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.
Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems
  • Pietro S. Oliveto
  • Jun He
  • Xin Yao
IEEE Transactions on Evolutionary Computation (2009) 13 (5): 1006.
On the Scalability of Real-Coded Bayesian Optimization Algorithm
  • R.S. Ramakrishna
IEEE Transactions on Evolutionary Computation (2008) 12 (3): 307.
A new approach to estimating the expected first hitting time of evolutionary algorithms
  • Yang Yu
  • Zhi-Hua Zhou
Artificial Intelligence (2008) 172 (15): 1809.
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results
  • Pietro S. Oliveto
  • Jun He
  • Xin Yao
International Journal of Automation and Computing (2007) 4 (3): 281.
Recent Advances in Evolutionary Computation
  • Xin Yao
  • Yong Xu
Journal of Computer Science and Technology (2006) 21 (1): 1.
The analysis of evolutionary algorithms on sorting and shortest paths problems
  • Jens Scharnow
  • Karsten Tinnefeld
  • Ingo Wegener
Journal of Mathematical Modelling and Algorithms (2005) 3 (4): 349.
Running Time Analysis of Multiobjective Evolutionary Algorithms on Pseudo-Boolean Functions
  • M. Laumanns
  • L. Thiele
  • E. Zitzler
IEEE Transactions on Evolutionary Computation (2004) 8 (2): 170.
Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching
  • Jun He
  • Xin Yao
Journal of Computer Science and Technology (2004) 19 (4): 450.
Drift analysis in studying the convergence and hitting times of evolutionary algorithms: An overview
  • He Jun
  • Yao Xin
Wuhan University Journal of Natural Sciences (2003) 8 (1): 143.
Towards an analytic framework for analysing the computation time of evolutionary algorithms
  • Jun He
  • Xin Yao
Artificial Intelligence (2003) 145 (1-2): 59.
From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms
IEEE Transactions on Evolutionary Computation (2002) 6 (5): 495.
Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise
  • Dirk V. Arnold
  • Hans-Georg Beyer
Theoretical Computer Science (2002) 289 (1): 629.
Drift analysis and average time complexity of evolutionary algorithms
  • Jun He
  • Xin Yao
Artificial Intelligence (2001) 127 (1): 57.

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