Following ICALP2003, the Thirtieth International Colloquium on Automata, Languages, and Programming (June 30 - July 4, 2003), a workshop on the Fundamentals of Evolutionary Algorithms will be held at the Technische Universiteit Eindhoven, The Netherlands.
With "Fundamentals", we do not restrict submissions to theoretical work, but would like to encourage work that deals with fundamental issues of evolutionary computation. To mention a few:
|What is the effect of mutation vs. recombination ? |
How does selective pressure affect the search ?
How big do you have to choose your population size ?
How fast is your algorithm, or how reliable to find good solutions ?
What is the "best" representation for a problem, if any ?
How many optima can an algorithm find within a single run ?
How does self-adaptation work, and under which circumstances ?
How to compare two evolutionary algorithms ?
Can we define function classes for which EAs behave similarly ?
Hybridization of EAs with other techniques.
13:00 - 14:30 Session 1
|N. Krasnogar Using Polynomial Local Search and Kolmogorov Complexity to Better Understand Evolutionary Algorithms|
|C.C.J. Moey, J.E. Rowe Population Aggregation Based on Fitness|
|J. He, X. Yao A Survey of Drift Analysis for Estimating Computation Time of Evolutionary Algorithms|
|A. Auger Markovian Exploration of Self-Adaptive Evolutionary Strategies|
14:30 - 14:45 Break
14:45 - 16:00 Session 2
|H. Zhang, J.E.Rowe Best Approximations of Pseudo-Boolean Functions|
|S. Kern, S.D.Müller, D. Büche, N. Hansen, P. Koumoutsakos Learning Probability Distributions in Continuous Evolutionary Algorithms|
|S.D. Müller, M.B. Fehr, P. Koumoutsakos Solving Constraint Optimization Problems Using the CMA-Evolution Strategy Combined with the Augmented Lagrangian Method|
16:00 - 16:30 Break
16:30 - 17:45 Session 3
|N. Krasnogar A Study on the Use of "Self-Generation" in Memetic Algorithms|
|M. Laumanns, L. Thiele, E. Zitzler Analysis of the Greedy Evolutionary Multiobjective Optimizer on the Multiobjective Leading Ones Problem|
|L. Willmes, T. Bäck Title to be announced|