Fitness levels with tail bounds for the analysis of randomized search heuristics
暂无分享,去创建一个
[1] Carsten Witt,et al. Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.
[2] Dirk Sudholt,et al. A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.
[3] Benjamin Doerr,et al. Analyzing Randomized Search Heuristics: Tools from Probability Theory , 2011, Theory of Randomized Search Heuristics.
[4] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[5] Benjamin Doerr,et al. Collecting Coupons with Random Initial Stake , 2013, ArXiv.
[6] Per Kristian Lehre,et al. General Drift Analysis with Tail Bounds , 2013, ArXiv.
[7] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[8] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.
[9] Dong Zhou,et al. The use of tail inequalities on the probable computational time of randomized search heuristics , 2012, Theor. Comput. Sci..
[10] Thomas Jansen,et al. Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .
[11] Ingo Wegener,et al. Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.