Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise

Chao Qian, Chao Bian, Wu Jiang, Ke Tang. Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise. Algorithmica, 81(2):749-795, 2019. [doi]

@article{QianBJT19,
  title = {Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise},
  author = {Chao Qian and Chao Bian and Wu Jiang and Ke Tang},
  year = {2019},
  doi = {10.1007/s00453-018-0488-4},
  url = {https://doi.org/10.1007/s00453-018-0488-4},
  researchr = {https://researchr.org/publication/QianBJT19},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {81},
  number = {2},
  pages = {749-795},
}