From black-box complexity to designing new genetic algorithms

Black-box complexity theory recently produced several surprisingly fast black-box optimization algorithms. In this work, we exhibit one possible reason: These black-box algorithms often profit from solutions inferior to the previous-best. In contrast, evolutionary approaches guided by the “survival...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 567; s. 87 - 104
Hlavní autori:	Doerr, Benjamin, Doerr, Carola, Ebel, Franziska
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.02.2015 Elsevier
Predmet:	Algorithms Asymptotic properties Black-box complexity Computer Science Crossovers Evolutionary Genetic algorithms Heuristic search Mathematical analysis Mathematical models Mutations Neural and Evolutionary Computing Run time (computers) Runtime analysis Theory of randomized search heuristics Heuristic search Theory of randomized search heuristics Runtime analysis Genetic algorithms Black-box complexity
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!