Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
暂无分享,去创建一个
[1] Pietro Simone Oliveto,et al. Theoretical analysis of fitness-proportional selection: landscapes and efficiency , 2009, GECCO.
[2] Ingo Wegener,et al. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .
[3] Xin Yao,et al. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..
[4] Pietro Simone Oliveto,et al. Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems , 2009, IEEE Transactions on Evolutionary Computation.
[5] Joshua D. Knowles,et al. Multiobjectivization by Decomposition of Scalar Cost Functions , 2008, PPSN.
[6] Pietro Simone Oliveto,et al. Evolutionary algorithms and the Vertex Cover problem , 2007, 2007 IEEE Congress on Evolutionary Computation.
[7] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[8] Vasek Chvátal,et al. The tail of the hypergeometric distribution , 1979, Discret. Math..
[9] Thomas Jansen,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization , 2004 .
[10] Dirk Sudholt,et al. Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima , 2011, Algorithmica.
[11] Per Kristian Lehre,et al. When is an estimation of distribution algorithm better than an evolutionary algorithm? , 2009, 2009 IEEE Congress on Evolutionary Computation.
[12] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[13] Pietro Simone Oliveto,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Theoretical Analysis of Diversity Mechanisms for Global Exploration Theoretical Analysis of Diversity Mechanisms for Global Exploration , 2022 .
[14] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[15] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[16] Per Kristian Lehre,et al. Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change , 2009, GECCO.
[17] Frank Neumann,et al. Rigorous analyses of fitness-proportional selection for optimizing linear functions , 2008, GECCO '08.
[18] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.
[19] Marc Schoenauer,et al. Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.