Bridging the gap between theory and practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3242, Issue , 2004, Pages 61-71

  Jansen, Thomas ^a   Paul Wiegand, R ^b,c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b Krasnow Institute for Advanced Study   (United States)

^c NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; PROBLEM SOLVING;

EMPIRICAL RESEARCH; EMPIRICAL STUDIES; FORMAL ANALYSIS; MODERN TECHNIQUES; PARAMETER CHOICE; RESEARCH PAPERS; RUN-TIME PERFORMANCE; THEORY AND PRACTICE;

COMPUTATION THEORY;

EID: 35048830354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_7     Document Type: Article

References (16)

1. S. Droste, T. Jansen, I. Wegener (2002): On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276:51-81.
2. J. He, X. Yao (2002): From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. Evolutionary Computation 6(5):495-511.
3. T. Jansen, K. A. De Jong (2002): An analysis of the role of offspring population size in EAs. Genetic and Evolutionary Computation Conf. (GECCO 2002), Morgan Kaufmann. 238-246.
4. T. Jansen, I. Wegener (2001): On the utility of populations. Genetic and Evolutionary Computation Conf. (GECCO 2001), Morgan Kaufmann. 1034-1041.
5. T. Jansen, I. Wegener (2002): On the analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica 34(1):47-66.
6. T. Jansen, I. Wegener (2004): Real royal road - where crossover provably is essential. To appear in Discrete Applied Mathematics.
7. T. Jansen, R. P. Wiegand (2003): Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA. Genetic and Evolutionary Computation Conf. (GECCO 2003), LNCS 2724, Springer. 310-321.
8. T. Jansen, R. P. Wiegand (2003): Sequential versus parallel cooperative coevolutionary (1+1) EAs. In Congress on Evolutionary Computation (CEC 2003), IEEE Press. 30-37.
9. T. Jansen, R.P. Wiegand (2004): The cooperative coevolutionary (1+1) EA. Accepted for Evolutionary Computation.
10. M. A. Potter, K. A. De Jong (1994): A cooperative coevolutionary approach to function optimization. Parallel Problem Solving from Nature (PPSN III), LNCS 866, Springer. 249-257.
11. Y. Rabani, Y. Rabinovich, A. Sinclair (1998): A computational view of population genetics. Random Structures and Algorithms 12(4):313-334.
12. T. Storch, I. Wegener (2003): Real royal road functions for constant population size. Genetic and Evolutionary Computation Conf. (GECCO 2003), LNCS 2724, Springer. 1406-1417.
13. R. P. Wiegand, B. Liles, K. A. De Jong (2002): The effects of cross-population epistasis on collaboration methods in cooperative coevolution. Parallel Problem Solving from Nature (PPSN VII). LNCS 2439, Springer. 257-270.
14. C. Witt (2003): Population size vs. runtime of a simple EA. Congress on Evolutionary Computation (CEC 2003), IEEE Press. 1996-2003.
15. C. Witt (2004): An analysis of the (μ+1) EA on simple pseudo-boolean functions. Accepted for GECCO 2004.
16. L. Bull (1997): Evolutionary Computing in Multi-agent Environments: Partners. Int'l Conf. on Genetic Algorithms (ICGA 1997), Morgan Kaufmann. 370-377.