English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Runtime Analysis of the (1+1) Evolutionary Algorithm on Strings over Finite Alphabets

MPS-Authors
/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44705

Johannsen,  Daniel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45399

Schmidt,  Martin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., Johannsen, D., & Schmidt, M. (2011). Runtime Analysis of the (1+1) Evolutionary Algorithm on Strings over Finite Alphabets. In H.-G. Beyer, & W. Langdon (Eds.), FOGA’11 (pp. 119-126). New York, NY: ACM. doi:10.1145/1967654.1967665.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-1292-0
Abstract
There is no abstract available