|
|||||||||||||||||||
|
|
|
||||||||||||||||||
Coevolution can be an effective approach for problems where performance can be measured using tests, as well as for problems in which multiple components that make up a whole are to be co-adapted. In addition to these forms of optimization, the adaptive nature of the evaluation process in coevolution may in principle give rise to a self-propelled and open-ended evolutionary process.
It has been found early on that the dynamic evaluation of coevolution can lead to unreliability. In recent years however, the possible goals for coevolutionary algorithms have become better understood, and for several algorithms theoretical properties have been provided. These developments generate the exciting prospect that practical reliable algorithms for coevolution may now be within reach.
The Coevolution Track of the 2005 Genetic and Evolutionary Computation Conference, GECCO 2005,
provides a venue where researchers from all directions and approaches
to coevolution can meet. Submissions on any aspect of coevolution are
encouraged, including but not limited to the following:
* Applications
* Measuring progress
* Game-theoretic studies
* New coevolutionary algorithms
* The structure of coevolution problems
* Empirical studies of coevolutionary methods
* Behavioral dynamics of coevolutionary setups
* Theoretical guarantees for coevolutionary algorithms
* Empirical comparisons between coevolutionary and other methods
Important dates
GECCO Paper submission deadline (EXTENDED): Sunday January 23, 2005.
Papers should be submitted directly to the GECCO conference; see the instructions for submitting papers there.
Track Chair
Edwin D. de Jong
Program Committee
Jean Berger
Anthony Bucci
Dave Cliff
Sevan Ficici
Uli Grasemann
Thomas Jansen
Hugues Juille
Risto Miikkulainen
Ludo Pagie
Kenneth Stanley
Benjamin Weinberg
Paul Wiegand