Crynodeb
We conduct a fixed-target runtime analysis of (1 + 1) EA with resampling on the OneMax and BinVal problems. For OneMax, our fixed-target upper bound refines the previously known bound. Our fixed-target lower bound for OneMax is the first of this kind. We also consider linear functions and show that the traditional approaches via drift analysis cannot easily be extended to yield fixed-target results. However, for the particular case of BinVal, a relatively precise fixed-target bound is obtained.
Iaith wreiddiol | Saesneg |
---|---|
Teitl | GECCO '19 |
Is-deitl | Proceedings of the Genetic and Evolutionary Computation Conference Companion |
Golygyddion | Manuel López-Ibáñez |
Tudalennau | 2068-2071 |
Nifer y tudalennau | 4 |
Dynodwyr Gwrthrych Digidol (DOIs) | |
Statws | Cyhoeddwyd - 13 Gorff 2019 |
Cyhoeddwyd yn allanol | Ie |
Digwyddiad | GECCO 2019: The Genetic and Evolutionary Computation Conference - Prague, Y Weriniaeth Tsiec Hyd: 13 Gorff 2019 → 17 Gorff 2019 https://gecco-2019.sigevo.org |
Cynhadledd
Cynhadledd | GECCO 2019: The Genetic and Evolutionary Computation Conference |
---|---|
Gwlad/Tiriogaeth | Y Weriniaeth Tsiec |
Dinas | Prague |
Cyfnod | 13 Gorff 2019 → 17 Gorff 2019 |
Cyfeiriad rhyngrwyd |