Keyword

expected optimization time

Description: The average time, often measured in evaluations or iterations, that a randomized search algorithm needs to reach an optimum.
OpenAlex ID: keywords/expected-optimization-time
2002 · Stefan Droste, Thomas Jansen, et al. · Theoretical Computer Science · 975
2012 · Benjamin Doerr, Daniel Johannsen, et al. · Algorithmica · 316
2013 · CARSTEN WITT · Combinatorics Probability Computing · 241
2003 · Oliver Giel, Ingo Wegener · Lecture notes in computer science · 201
2017 · Duc-Cuong Dang, Tobias Friedrich, et al. · IEEE Transactions on Evolutionary Computation · 197
2004 · Thomas Jansen, R. Paul Wiegand · Evolutionary Computation · 91
2015 · Benjamin Doerr, Carola Doerr · Genetic and Evolutionary Computation Conference (GECCO) · 84
2007 · Frank Neumann · Computers & Operations Research · 81
2004 · Tobias Storch, Ingo Wegener · Theoretical Computer Science · 80
2005 · Simon Fischer, Ingo Wegener · Theoretical Computer Science · 76
2002 · Droste, Stefan, Jansen, Thomas, et al. · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · 75
2008 · Edda Happ, Daniel Johannsen, et al. · Genetic and Evolutionary Computation Conference (GECCO) · 64
2018 · Benjamin Doerr, Christian Gießen, et al. · Algorithmica · 63
2012 · Benjamin Doerr, Daniel Johannsen, et al. · Theoretical Computer Science · 59
2004 · Simon Fischer, Ingo Wegener · Lecture notes in computer science · 52
2003 · Thomas Jansen, R. Paul Wiegand · Lecture notes in computer science · 51
2003 · M. Dietzfelbinger, B. Naudts, et al. · IEEE Transactions on Evolutionary Computation · 49
2020 · Benjamin Doerr, Carsten Witt, et al. · Algorithmica · 45
2018 · Pinto, Eduardo Carvalho, Doerr, Carola · arXiv (Cornell University) · 45
2015 · Benjamin Doerr, Carola Doerr · Genetic and Evolutionary Computation Conference (GECCO) · 43
2012 · Witt, Carsten · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 38
Works count: 90
Citation count: 4,172
Year
Topic
Type