Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
出版年份 2020 全文链接
标题
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
作者
关键词
-
出版物
EVOLUTIONARY COMPUTATION
Volume -, Issue -, Pages 1-25
出版商
MIT Press - Journals
发表日期
2020-11-17
DOI
10.1162/evco_a_00283
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Runtime analysis of evolutionary algorithms via symmetry arguments
- (2020) Benjamin Doerr INFORMATION PROCESSING LETTERS
- Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax
- (2018) Carsten Witt ALGORITHMICA
- Drift Analysis and Evolutionary Algorithms Revisited
- (2018) J. LENGLER et al. COMBINATORICS PROBABILITY & COMPUTING
- Analyzing randomized search heuristics via stochastic domination
- (2018) Benjamin Doerr THEORETICAL COMPUTER SCIENCE
- Level-Based Analysis of Genetic Algorithms and Other Search Processes
- (2017) Dogan Corus et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
- (2016) Duc-Cuong Dang et al. ALGORITHMICA
- Concentration of First Hitting Times Under Additive Drift
- (2015) Timo Kötzing ALGORITHMICA
- Improved time complexity analysis of the Simple Genetic Algorithm
- (2015) Pietro S. Oliveto et al. THEORETICAL COMPUTER SCIENCE
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- (2013) CARSTEN WITT COMBINATORICS PROBABILITY & COMPUTING
- On the runtime analysis of the Simple Genetic Algorithm
- (2013) Pietro S. Oliveto et al. THEORETICAL COMPUTER SCIENCE
- The choice of the offspring population size in the (1,λ) evolutionary algorithm
- (2013) Jonathan E. Rowe et al. THEORETICAL COMPUTER SCIENCE
- Multiplicative Drift Analysis
- (2012) Benjamin Doerr et al. ALGORITHMICA
- Adaptive Drift Analysis
- (2011) Benjamin Doerr et al. ALGORITHMICA
- Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
- (2011) Benjamin Doerr et al. EVOLUTIONARY COMPUTATION
- Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
- (2010) Pietro S. Oliveto et al. ALGORITHMICA
- A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems
- (2009) Tianshi Chen et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started