Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018)
暂无分享,去创建一个
[1] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[2] Stefan Droste,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Analysis of the (1+1) Ea for a Dynamically Bitwise Changing Onemax Analysis of the (1+1) Ea for a Dynamically Bitwise Changing Onemax , 2003 .
[3] Benjamin Doerr,et al. Analyzing randomized search heuristics via stochastic domination , 2019, Theor. Comput. Sci..
[4] Dong Zhou,et al. The use of tail inequalities on the probable computational time of randomized search heuristics , 2012, Theor. Comput. Sci..
[5] Dorian Nogneng,et al. A new analysis method for evolutionary optimization of dynamic and noisy objective functions , 2018, GECCO.
[6] Benjamin Doerr,et al. A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax , 2015, GECCO.
[7] Stefan Droste,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of the (1+1) EA for a Noisy OneMax , 2004 .
[8] Anton V. Eremeev,et al. Comparing evolutionary algorithms to the (1+1)-EA , 2008, Theor. Comput. Sci..
[9] Carsten Witt,et al. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.
[10] Dirk Sudholt,et al. Runtime analysis of binary PSO , 2008, GECCO '08.
[11] S. Janson. Tail bounds for sums of geometric and exponential variables , 2017, 1709.08157.
[12] Benjamin Doerr,et al. Better Runtime Guarantees via Stochastic Domination , 2018, EvoCOP.
[13] Carsten Witt,et al. Fitness levels with tail bounds for the analysis of randomized search heuristics , 2014, Inf. Process. Lett..
[14] Benjamin Doerr,et al. Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem , 2011, Evolutionary Computation.