Main Page

Proceedings Table of Contents
Companion Table of Contents
Author Index

Track 1: Ant Colony Optimization, Swarm Intelligence, and Artificial Immune Systems
Track 2: Artificial Life, Evolutionary Robotics, Adaptive Behavior, Evolvable Hardware
Track 3: Bioinformatics and Computational Biology
Track 4: Coevolution
Track 5: Estimation of Distribution Algorithms
Track 6: Evolution Strategies, Evolutionary Programming
Track 7: Evolutionary Combinatorial Optimization
Track 8: Evolutionary Multiobjective Optimization
Track 9: Formal Theory
Track 10: Generative and Developmental Systems
Track 11: Genetic Algorithms
Track 12: Genetic Programming
Track 13: Genetics-Based Machine Learning and Learning Classifier Systems
Track 14: Real-World Application
Track 15: Search-based Software Engineering

Table of Contents

Track 4: Coevolution

GECCO 2008 Main Proceedings Table of Contents

Posters

Papers

Fitnessless Coevolution (Page 355)
Wojciech Jaśkowski (Poznan University of Technology)
Krzysztof Krawiec (Poznan University of Technology)
Bartosz Wieloch (Poznan University of Technology)

Managing Team-Based Problem Solving with Symbiotic Bid-Based Genetic Programming (Page 363)
Peter Lichodzijewski (Dalhousie University)
Malcolm I. Heywood (Dalhousie University)

A No-Free-Lunch Framework for Coevolution (Page 371)
Travis C. Service (Missouri University of Science and Technology)
Daniel R. Tauritz (Missouri University of Science and Technology)

An Empirical Comparison of Evolution and Coevolution for Designing Artificial Neural Network Game Players (Page 379)
Min Shi (Norwegian University of Science and Technology)

Posters

Co-Optimization Algorithms (Page 387)
Travis C. Service (Missouri University of Science and Technology)
Daniel R. Tauritz (Missouri University of Science and Technology)

A Coevolution Archive Based on Problem Dimension (Page 389)
Liping Yang (Beijing Jiaotong University and Shandong University of Finance)
Houkuan Huang (Beijing Jiaotong University)
Yabin Liu (Shandong University of Finance)

(Return to Top)