Evolutionary Computation, Volume 15

Volume 15, Number 1, Spring 2007

• Marc Schoenauer:
  Editorial Introduction.
  

• Christian Igel, Nikolaus Hansen, Stefan Roth:
  Covariance Matrix Adaptation for Multi-objective Optimization. 1-28
  
• Jim Smith:
  On Replacement Strategies in Steady State Evolutionary Algorithms. 29-59
  
• Edwin D. de Jong:
  A Monotonic Archive for Pareto-Coevolution. 61-93
  
• Riccardo Poli, Christopher R. Stephens:
  Understanding the Biases of Generalised Recombination: Part II. 95-131
  

Volume 15, Number 2, Summer 2007

• Marc Schoenauer:
  In Memoriam Laurence J. Fogel.
  
• Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wilson, David E. Goldberg:
  Generalization in the XCSF Classifier System: Analysis, Improvement, and Extension. 133-168
  
• Dong-il Seo, Byung Ro Moon:
  An Information-Theoretic Analysis on the Interactions of Variables in Combinatorial Optimization Problems. 169-198
  
• Jens Niehaus, Christian Igel, Wolfgang Banzhaf:
  Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database. 199-221
  
• Zhou Ji, Dipankar Dasgupta:
  Revisiting Negative Selection Algorithms. 223-251
  

Volume 15, Number 3, Fall 2007

• Marc Schoenauer:
  Editorial Introduction.
  
• Chien-Feng Huang, Jasleen Kaur, Ana Gabriela Maguitman, Luis Mateus Rocha:
  Agent-Based Model of Genotype Editing. 253-289
  
• Chryssomalis Chryssomalakos, Christopher R. Stephens:
  Covariant Genetic Dynamics. 291-320
  
• Xavier Thibert-Plante, Paul Charbonneau:
  Crossover and Evolutionary Stability in the Prisoner's Dilemma. 321-344
  
• Fabien Picarougne, Hanene Azzag, Gilles Venturini, Christiane Guinot:
  A New Approach of Data Clustering Using a Flock of Agents. 345-367
  
• Shingo Mabu, Kotaro Hirasawa, Jinglu Hu:
  A Graph-Based Evolutionary Algorithm: Genetic Network Programming (GNP) and Its Extension Using Reinforcement Learning. 369-398
  

Volume 15, Number 4, Winter 2007

• Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
  Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. 401-410
  
• Sylvain Gelly, Sylvie Ruette, Olivier Teytaud:
  Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime. 411-434
  
• Jun He, Colin R. Reeves, Carsten Witt, Xin Yao:
  A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. 435-443
  
• Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon:
  Geometric Crossovers for Multiway Graph Partitioning. 445-474
  
• Olivier Teytaud:
  On the Hardness of Offline Multi-objective Optimization. 475-491
  

• Alfredo García Hernández-Díaz, Luis V. Santana-Quintero, Carlos A. Coello Coello, Julián Molina Luque:
  Pareto-adaptive epsilon-dominance. 493-517