Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
暂无分享,去创建一个
[1] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[2] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[3] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2010, PPSN.
[4] Martin Skutella,et al. Evolutionary Algorithms and Matroid Optimization Problems , 2007, GECCO '07.
[5] Martin Skutella,et al. On the size of weights in randomized search heuristics , 2009, FOGA '09.
[6] Timo Kötzing,et al. Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints , 2020, Theor. Comput. Sci..
[7] Thomas Jansen,et al. Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.
[8] Mojgan Pourhassan,et al. Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint , 2019, Algorithmica.
[9] Ingo Wegener,et al. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..
[10] Jens Jägersküpper,et al. Combining Markov-Chain Analysis and Drift Analysis , 2011, Algorithmica.
[11] Dirk Sudholt,et al. The choice of the offspring population size in the (1,λ) EA , 2012, GECCO '12.
[12] Daniel Johannsen,et al. Random combinatorial structures and randomized search heuristics , 2010 .
[13] Benjamin Doerr,et al. Multiplicative Drift Analysis , 2010, GECCO '10.
[14] Benjamin Doerr,et al. Drift analysis and linear functions revisited , 2010, IEEE Congress on Evolutionary Computation.
[15] Benjamin Doerr,et al. Multiplicative drift analysis , 2010, GECCO.
[16] Carsten Witt,et al. Revised analysis of the (1+1) ea for the minimum spanning tree problem , 2014, GECCO.
[17] Benjamin Doerr,et al. Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet , 2012, GECCO '12.
[18] 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..
[19] Thomas Jansen,et al. Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .
[20] Dirk Sudholt,et al. When do evolutionary algorithms optimize separable functions in parallel? , 2013, FOGA XII '13.
[21] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[22] Jens Jägersküpper,et al. A Blend of Markov-Chain and Drift Analysis , 2008, PPSN.
[23] Per Kristian Lehre,et al. Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift , 2014, ISAAC.
[24] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[25] Carsten Witt,et al. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.
[26] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2011, Algorithmica.
[27] Frank Neumann,et al. Computing Minimum Cuts by Randomized Search Heuristics , 2008, GECCO '08.