Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57200540, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57200540 / rank | |||
Normal rank | |||
Revision as of 13:50, 7 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
