Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646)
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: Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax |
scientific article |
Statements
Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (English)
0 references
14 February 2019
0 references
randomized search heuristics
0 references
estimation-of-distribution algorithms
0 references
UMDA
0 references
running time analysis
0 references
0 references
0 references
0.98466146
0 references
0.98466146
0 references
0.91149485
0 references
0.8480437
0 references
0.83914137
0 references
0.8344627
0 references
0.8329657
0 references
0 references
