The \((1+1)\) elitist black-box complexity of LeadingOnes (Q1750359)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The (1+1) elitist black-box complexity of LeadingOnes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \((1+1)\) elitist black-box complexity of LeadingOnes |
scientific article |
Statements
The \((1+1)\) elitist black-box complexity of LeadingOnes (English)
0 references
18 May 2018
0 references
black-box complexity
0 references
query complexity
0 references
LeadingOnes
0 references
elitist algorithm
0 references
memory restriction
0 references
truncation selection
0 references
evolutionary algorithms
0 references
0.8244497776031494
0 references
0.7893312573432922
0 references
0.7815400958061218
0 references
0.7750922441482544
0 references
0.7727780938148499
0 references
