Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ
暂无分享,去创建一个
[1] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[2] Benjamin Doerr,et al. Lessons from the black-box: fast crossover-based genetic algorithms , 2013, GECCO '13.
[3] Benjamin Doerr,et al. Unbiased Black-Box Complexities of Jump Functions , 2014, Evolutionary Computation.
[4] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[5] 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 .
[6] Per Kristian Lehre,et al. Faster black-box algorithms through higher arity operators , 2010, FOGA '11.