Quasirandom evolutionary algorithms

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1457-1464

  Doerr, Benjamin ^a   Fouz, Mahmoud ^b   Witt, Carsten ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Evolutionary algorithms; Quasirandomness

Indexed keywords

EVOLUTIONARY COMPUTATIONS; QUASI-RANDOM; QUASI-RANDOMNESS; RUNTIMES; SPEED-UPS;

CALCULATIONS;

EVOLUTIONARY ALGORITHMS;

EID: 77955873367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830749     Document Type: Conference Paper

References (13)

1. J. N. Cooper andJ. Spencer. Simulating a random walk with constant error. Combinatorics, Probability and Computing, 15:815-822, 2006.
2. B. Doerr. Introducing quasirandomness to computer science. In Efficient Algorithms 2009, pages 99-111, 2009.
3. B. Doerr, T. Friedrich, M. Künnemann, andT. Sauerwald. Quasirandom rumor spreading: An experimental analysis. In 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 145-153, 2009.
4. B. Doerr, T. Friedrich, andT. Sauerwald. Quasirandom rumor spreading. In 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 773-781, 2008.
5. B. Doerr, T. Friedrich, andT. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 366-377, 2009.
6. B. Doerr, D. Johannsen, andC. Winzen. Drift analysis and linear functions revisited. In Congress on Evolutionary Computation (CEC-2010), 2010. To appear.
7. S. Droste, T. Jansen, andI. Wegener. On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276:51-81, 2002.
8. T. Friedrich, M. Gairing, andT. Sauerwald. Quasirandom load balancing. In 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1620-1629, 2010.
9. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
10. J. Jägersküpper. Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science, 379:329-347, 2007.
11. T. Jansen, K. A. De Jong, andI. Wegener. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13:413-440, 2005.
12. O. Teytaud. When does quasi-random work? In Proceedings of PPSN 2008, pages 325-336, 2008.
13. C. Witt. Runtime Analysis of the (μ + 1) EA on Simple pseudo-Boolean functions. Evolutionary Computation, 14:65-86, 2006.