Name
Abstract | ||
|---|---|---|
We give a detailed analysis of the optimization time of the -Evolutionary Algorithm under two simple fitness functions (OneMax and LeadingOnes). The problem has been approached in the evolutionary algorithm literature in various ways and with different degrees of rigor. Our asymptotic approximations for the mean and the variance represent the strongest of their kind. The approach we develop is bas... |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1162/evco_a_00212 | Evolutionary Computation |
Keywords | Field | DocType |
(1+1)-evolutionary algorithm,probabilistic analysis,OneMax function,LeadingOnes function,asymptotic approximations,error analysis,limit laws,recurrences. | Limit of a function,Combinatorics,Mathematical optimization,Evolutionary algorithm,Probabilistic analysis of algorithms,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 2 | 1063-6560 |
Citations | PageRank | References |
9 | 0.51 | 23 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hsien-Kuei Hwang | 1 | 365 | 38.02 |
| Alois Panholzer | 2 | 9 | 0.51 |
| Nicolas Rolin | 3 | 9 | 0.51 |
| Tsung-Hsi Tsai | 4 | 81 | 8.20 |
| Wei‐Mei Chen | 5 | 57 | 9.26 |