ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1711.00956
  4. Cited By
Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under
  Bit-wise Noise
v1v2 (latest)

Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise

2 November 2017
Chao Qian
Chao Bian
Wu Jiang
K. Tang
ArXiv (abs)PDFHTML

Papers citing "Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise"

5 / 5 papers shown
Title
Level-based Analysis of Genetic Algorithms and other Search Processes
Level-based Analysis of Genetic Algorithms and other Search Processes
Dogan Corus
D. Dang
A. Eremeev
Per Kristian Lehre
64
144
0
29 Jul 2014
Analyzing Evolutionary Optimization in Noisy Environments
Analyzing Evolutionary Optimization in Noisy Environments
Chao Qian
Yang Yu
Zhi Zhou
60
54
0
20 Nov 2013
Erratum: Simplified Drift Analysis for Proving Lower Bounds in
  Evolutionary Computation
Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
P. S. Oliveto
Carsten Witt
64
61
0
30 Nov 2012
A New Method for Lower Bounds on the Running Time of Evolutionary
  Algorithms
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
Dirk Sudholt
70
157
0
07 Sep 2011
Multiplicative Drift Analysis
Multiplicative Drift Analysis
Benjamin Doerr
Daniel Johannsen
Carola Doerr
75
282
0
04 Jan 2011
1