Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:42, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
