"Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and ..."

Chao Qian et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0488-4

access: closed

type: Journal Article

metadata version: 2022-12-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/QianBJT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/QianBJT19
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.