相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise
Chao Qian et al.
ALGORITHMICA (2019)
Drift Analysis and Evolutionary Algorithms Revisited
J. Lengler et al.
COMBINATORICS PROBABILITY & COMPUTING (2018)
Analyzing Evolutionary Optimization in Noisy Environments
Chao Qian et al.
EVOLUTIONARY COMPUTATION (2018)
On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments
Chao Qian et al.
EVOLUTIONARY COMPUTATION (2018)
Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise
Chao Bian et al.
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT II (2018)
Towards a Runtime Comparison of Natural and Artificial Evolution
Tiago Paixao et al.
ALGORITHMICA (2017)
Robustness of Populations in Stochastic Environments
Christian Giessen et al.
ALGORITHMICA (2016)
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
Duc-Cuong Dang et al.
ALGORITHMICA (2016)
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator
Anh Quang Nguyen et al.
THEORETICAL COMPUTER SCIENCE (2015)
Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
Youhei Akimoto et al.
THEORETICAL COMPUTER SCIENCE (2015)
Robustness of Ant Colony Optimization to Noise
Tobias Friedrich et al.
GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (2015)
The choice of the offspring population size in the (1, λ) evolutionary algorithm
Jonathan E. Rowe et al.
THEORETICAL COMPUTER SCIENCE (2014)
On the Runtime Analysis of Stochastic Ageing Mechanisms
Pietro S. Oliveto et al.
GECCO'14: PROCEEDINGS OF THE 2014 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (2014)
An analysis on recombination in multi-objective evolutionary optimization
Chao Qian et al.
ARTIFICIAL INTELLIGENCE (2013)
Design and analysis of migration in parallel evolutionary algorithms
Joerg Laessig et al.
SOFT COMPUTING (2013)
A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems
Dirk Sudholt et al.
ALGORITHMICA (2012)
Ants Easily Solve Stochastic Shortest Path Problems
Benjamin Doerr et al.
PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (2012)
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Pietro S. Oliveto et al.
ALGORITHMICA (2011)
Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments
Mohamed Jebalia et al.
ALGORITHMICA (2011)
Mutation Rate Matters Even When Optimizing Monotonic Functions
Benjamin Doerr et al.
EVOLUTIONARY COMPUTATION (2011)
On the Effect of Populations in Evolutionary Multi-Objective Optimisation
Oliver Giel et al.
EVOLUTIONARY COMPUTATION (2010)
Analysis of an Asymmetric Mutation Operator
Thomas Jansen et al.
EVOLUTIONARY COMPUTATION (2010)
A survey on metaheuristics for stochastic combinatorial optimization
Leonora Bianchi et al.
Natural Computing (2008)
An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem
Vincenzo Cutello et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2007)
On the choice of the offspring population size in evolutionary algorithms
T Jansen et al.
EVOLUTIONARY COMPUTATION (2005)
Evolutionary optimization in uncertain environments - A survey
Y Jin et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2005)
Running time analysis of multiobjective evolutionary algorithms on Pseudo-Boolean functions
M Laumanns et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2004)
On the analysis of the (1+1) evolutionary algorithm
S Droste et al.
THEORETICAL COMPUTER SCIENCE (2002)
Evolutionary algorithms in noisy environments: theoretical issues and guidelines for practice
HG Beyer
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING (2000)