Drift analysis and linear functions revisited

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Doerr, Benjamin ^a   Johannsen, Daniel ^a   Winzen, Carola ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-STRINGS; CLASSICAL PROBLEMS; DRIFT ANALYSIS; GLOBAL OPTIMUM; LINEAR FUNCTIONS; LOWER BOUNDS; PSEUDO-BOOLEAN FUNCTION; RUNTIMES;

ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

BOOLEAN FUNCTIONS;

EID: 79959468230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586097     Document Type: Conference Paper

References (12)

1. B. Doerr, M. Fouz, and C. Witt. Quasirandom evolutionary algorithms. In GECCO'10: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference. ACM, 2010. To appear.
2. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. In GECCO'10: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference. ACM, 2010. To appear.
3. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276(1-2):51-81, 2002.
4. O. Giel and P. K. Lehre. On the effect of populations in evolutionary multi-objective optimization. In GECCO'06: Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference, pages 651-658. ACM, 2006.
5. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14(3):387-403, 1982.
6. E. Happ, D. Johannsen, C. Klein, and F. Neumann. Rigorous analyses of fitness-proportional selection for optimizing linear functions. In GECCO'08: Proceedings of the 10th Annual Genetic and Evolutionary Computation Conference, pages 953-960. ACM, 2008.
7. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Acta Informatica, 127(1):51-81, 2001.
8. J. He and X. Yao. Towards an analytic framework for analysing the computation time of evolutionary algorithms. Acta Informatica, 145(1-2):59-97, 2003.
9. J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35, 2004. (Pubitemid 39127657)
10. J. Jägersküpper. A blend of Markov-chain and drift analysis. In PPSN '08: Proceedings of the 10th International Conference on Parallel Problem Solving from Nature, pages 41-51. Springer, 2008.
11. P. S. Oliveto and C. Witt. Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica, 2010. In press.
12. D. Scheder and E. Welzl. Private communications.