- Home
- Publications
- Publication Search
- Publication Details
Title
Does Comma Selection Help to Cope with Local Optima?
Authors
Keywords
-
Journal
ALGORITHMICA
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2022-01-10
DOI
10.1007/s00453-021-00896-7
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Runtime Analysis for Self-adaptive Mutation Rates
- (2020) Benjamin Doerr et al. ALGORITHMICA
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- (2020) Phan Trung Hai Nguyen et al. ARTIFICIAL INTELLIGENCE
- 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
- Escaping Local Optima Using Crossover With Emergent Diversity
- (2018) Duc-Cuong Dang et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Level-Based Analysis of the Univariate Marginal Distribution Algorithm
- (2018) Duc-Cuong Dang et al. ALGORITHMICA
- 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
- Towards a Runtime Comparison of Natural and Artificial Evolution
- (2016) Tiago Paixão et al. ALGORITHMICA
- The Interplay of Population Size and Mutation Probability in the ( $$1+\lambda $$ 1 + λ ) EA on OneMax
- (2016) Christian Gießen et al. ALGORITHMICA
- 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
- Optimizing linear functions with the (1+λ) evolutionary algorithm—Different asymptotic runtimes for different instances
- (2015) Benjamin Doerr et al. THEORETICAL COMPUTER SCIENCE
- 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
- The choice of the offspring population size in the (1,λ) evolutionary algorithm
- (2013) Jonathan E. Rowe et al. THEORETICAL COMPUTER SCIENCE
- A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
- (2012) Dirk Sudholt IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Adaptive Drift Analysis
- (2011) Benjamin Doerr et al. ALGORITHMICA
- Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
- (2010) Pietro S. Oliveto et al. ALGORITHMICA
- The impact of parametrization in memetic evolutionary algorithms
- (2009) Dirk Sudholt THEORETICAL COMPUTER SCIENCE
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchAdd 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 Now