Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
暂无分享,去创建一个
[1] Per Kristian Lehre,et al. Drift analysis , 2012, GECCO '12.
[2] Andrew M. Sutton,et al. Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs , 2019, Algorithmica.
[3] Pietro Simone Oliveto,et al. On the runtime analysis of the Simple Genetic Algorithm , 2014, Theor. Comput. Sci..
[4] Benjamin Doerr,et al. Multiplicative Up-Drift , 2019, Algorithmica.
[5] Pietro Simone Oliveto,et al. On the analysis of the simple genetic algorithm , 2012, GECCO '12.
[6] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[7] Duc-Cuong Dang,et al. Self-adaptation of Mutation Rates in Non-elitist Populations , 2016, PPSN.
[8] Angelika Steger,et al. Drift Analysis and Evolutionary Algorithms Revisited , 2016, Combinatorics, Probability and Computing.
[9] Benjamin Doerr. Does comma selection help to cope with local optima? , 2020, GECCO.
[10] Pietro Simone Oliveto,et al. Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..
[11] Pietro Simone Oliveto,et al. Theoretical analysis of fitness-proportional selection: landscapes and efficiency , 2009, GECCO.
[12] Carsten Witt,et al. Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .
[13] Duc-Cuong Dang,et al. Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information , 2016, Algorithmica.
[14] Benjamin Doerr. Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments , 2021, Inf. Process. Lett..
[15] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[16] Duc-Cuong Dang,et al. Level-Based Analysis of Genetic Algorithms and Other Search Processes , 2014, bioRxiv.
[17] Timo Kötzing. Concentration of First Hitting Times Under Additive Drift , 2015, Algorithmica.
[18] Benjamin Doerr,et al. Analyzing randomized search heuristics via stochastic domination , 2019, Theor. Comput. Sci..
[19] Markus Wagner,et al. Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations , 2018, Natural Computing.
[20] I. Wegener,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods A Natural and Simple Function Which is Hard For All Evolutionary Algorithms , 2007 .
[21] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[22] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2011, Algorithmica.
[23] Xin Yao,et al. A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[24] Jens Jägersküpper,et al. A Blend of Markov-Chain and Drift Analysis , 2008, PPSN.
[25] Benjamin Doerr. Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift , 2020, Evolutionary Computation.
[26] Jens Jägersküpper,et al. When the Plus Strategy Outperforms the Comma Strategyand When Not , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.
[27] Carsten Witt,et al. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.
[28] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[29] Benjamin Doerr,et al. Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem , 2011, Evolutionary Computation.
[30] Benjamin Doerr,et al. The Runtime of the Compact Genetic Algorithm on Jump Functions , 2019, Algorithmica.
[31] Benjamin Doerr,et al. Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions , 2020, PPSN.
[32] Benjamin Doerr,et al. Fixed-Target Runtime Analysis , 2020, Algorithmica.
[33] Benjamin Doerr,et al. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , 2018, Theory of Evolutionary Computation.
[34] Chao Qian,et al. Dynamic Mutation Based Pareto Optimization for Subset Selection , 2018, ICIC.
[35] Carsten Witt,et al. Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax , 2018, Algorithmica.
[36] Pietro Simone Oliveto,et al. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.
[37] Benjamin Doerr,et al. Improved analysis methods for crossover-based algorithms , 2009, GECCO.
[38] Jonathan E. Rowe,et al. Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links , 2009, Int. J. Intell. Comput. Cybern..
[39] Benjamin Doerr,et al. The efficiency threshold for the offspring population size of the (µ, λ) EA , 2019, GECCO.
[40] Dirk Sudholt,et al. The choice of the offspring population size in the (1, λ) evolutionary algorithm , 2014, Theor. Comput. Sci..
[41] Per Kristian Lehre,et al. Fitness-levels for non-elitist populations , 2011, GECCO '11.
[42] Benjamin Doerr,et al. Fast genetic algorithms , 2017, GECCO.
[43] Benjamin Doerr. Exponential Upper Bounds for the Runtime of Randomized Search Heuristics , 2020, PPSN.
[44] Frank Neumann,et al. Rigorous analyses of fitness-proportional selection for optimizing linear functions , 2008, GECCO '08.
[45] Pietro Simone Oliveto,et al. Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, PPSN.
[46] Maxim Buzdalov,et al. Evaluation of heavy-tailed mutation operator on maximum flow test generation problem , 2017, GECCO.
[47] Markus Wagner,et al. Escaping large deceptive basins of attraction with heavy-tailed mutation operators , 2018, GECCO.
[48] Carsten Witt,et al. Runtime Analysis of the ( + 1) EA on Simple Pseudo-Boolean Functions , 2006, Evolutionary Computation.
[49] Per Kristian Lehre,et al. Negative Drift in Populations , 2010, PPSN.
[50] Benjamin Doerr,et al. Multiplicative Drift Analysis , 2010, GECCO '10.
[51] Benjamin Doerr,et al. First Steps Towards a Runtime Analysis When Starting With a Good Solution , 2020, PPSN.
[52] Daniel Johannsen,et al. Random combinatorial structures and randomized search heuristics , 2010 .