Dagstuhl Seminar Proceedings:
Theory of Evolutionary Algorithms 2006
Dirk V. Arnold, Thomas Jansen, Michael D. Vose, Jonathan E. Rowe (Eds.):
Theory of Evolutionary Algorithms, 05.02. - 10.02.2006.
Dagstuhl Seminar Proceedings 06061 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- Frank Neumann, Carsten Witt:
Runtime Analysis of a Simple Ant Colony Optimization Algorithm.
- Anton V. Eremeev:
On Complexity of Optimized Crossover for Binary Representations.
- Marcus Gallagher, Bo Yuan:
A Mathematical Modelling Technique for the Analysis of the Dynamics of a Simple Continuous EDA.
- William B. Langdon, Riccardo Poli:
On Turing complete T7 and MISC F--4 program fitnes landscapes.
- Boris Mitavskiy, Jonathan E. Rowe:
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?.
- Heinz Mühlenbein, Robin Höns:
The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle.
- Rudi Cilibrasi, Paul M. B. Vitányi:
A New Quartet Tree Heuristic for Hierarchical Clustering.
- Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose:
06061 Executive Summary -- Theory of Evolutionary Algoritms.
- Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose:
06061 Abstracts Collection -- Theory of Evolutionary Algorithms.
Copyright © Mon Mar 15 03:28:29 2010
by Michael Ley (ley@uni-trier.de)