Evolutionary Computation, Volume 20

Volume 20, Number 1, Spring 2012

• Kent McClymont, Ed Keedwell:
  Deductive Sort and Climbing Sort: New Methods for Non-Dominated Sorting. 1-26
  
• Kalyanmoy Deb, Amit Saha:
  Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm. 27-62
  
• Edmund K. Burke, Matthew R. Hyde, Graham Kendall, John Woodward:
  Automating the Packing Heuristic Design Process with Genetic Programming. 63-89
  
• Jean-Baptiste Mouret, Stéphane Doncieux:
  Encouraging Behavioral Diversity in Evolutionary Robotics: An Empirical Study. 91-133
  
• Mark Hauschild, Martin Pelikan, Kumara Sastry, David E. Goldberg:
  Using Previous Models to Bias Structural Learning in the Hierarchical BOA. 135-160
  

Volume 20, Number 2, Summer 2012

• Gabriela Ochoa, Mike Preuss, Thomas Bartz-Beielstein, Marc Schoenauer:
  Editorial for the Special Issue on Automated Design and Assessment of Heuristic Search Methods. 161-163
  
• J. E. Smith:
  Estimating Meme Fitness in Adaptive Memetic Algorithms for Combinatorial Problems. 165-188
  
• Zhilei Ren, He Jiang, Jifeng Xuan, Zhongxuan Luo:
  Hyper-Heuristics with Low Level Parameter Adaptation. 189-227
  
• Tobias Wagner, Simon Wessing:
  On the Effect of Response Transformations in Sequential Parameter Optimization. 229-248
  
• Bernd Bischl, Olaf Mersmann, Heike Trautmann, Claus Weihs:
  Resampling Methods for Meta-Model Validation with Recommendations for Evolutionary Computation. 249-275
  
• R. Morgan, M. Gallagher:
  Using Landscape Topology to Compare Continuous Metaheuristics: A Framework and Case Study on EDAs and Ridge Structure. 277-299
  

• Shade T. Shutters:
  Punishment Leads to Cooperative Behavior in Structured Societies. 301-319
  

Volume 20, Number 3, Fall 2012

• Jing Liu, Hussein A. Abbass, David G. Green, Weicai Zhong:
  Motif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs. 321-347
  
• Jun Sun, Wei Fang, Xiaojun Wu, Vasile Palade, Wenbo Xu:
  Quantum-Behaved Particle Swarm Optimization: Analysis of Individual Particle Behavior and Parameter Selection. 349-393
  
• Walter J. Gutjahr:
  Runtime Analysis of an Evolutionary Algorithm for Stochastic Multi-Objective Combinatorial Optimization. 395-421
  
• David Hadka, Patrick M. Reed:
  Diagnostic Assessment of Search Controls and Failure Modes in Many-Objective Evolutionary Optimization. 423-452
  
• Alexandre Devert, Thomas Weise, Ke Tang:
  A Study on Scalable Representations for Evolutionary Optimization of Ground Structures. 453-472
  

Volume 20, Number 4, Winter 2012

• Anne Auger, Nikolaus Hansen, Marc Schoenauer:
  Benchmarking of Continuous Black Box Optimization Algorithms. 481
  
• Petr Posík, Jirí Kubalík:
  Experimental Comparison of Six Population-Based Algorithms for Continuous Black Box Optimization. 483-508
  
• Petr Posík, Waltraud Huyer, László Pál:
  A Comparison of Global Search Algorithms for Continuous Black Box Optimization. 509-541
  
• Christian L. Müller, Ivo F. Sbalzarini:
  Energy Landscapes of Atomic Clusters as Black Box Optimization Benchmarks. 543-573
  
• Petr Posík, Waltraud Huyer:
  Restarted Local Search Algorithms for Continuous Black Box Optimization. 575-607
  
• László Pál, Tibor Csendes, Mihály Csaba Markót, Arnold Neumaier:
  Black Box Optimization Benchmarking of the GLOBAL Method. 609-639
  

• Noureddine Bouhmala:
  A Multilevel Memetic Algorithm for Large SAT-Encoded Problems. 641-664
  

Last update Thu May 23 18:42:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page