Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Issues

Volume 18, Issue 1
Spring 2010
Issue Cover
All Issues
ISSN 1063-6560
EISSN 1530-9304
In this Issue
Analysis of an Asymmetric Mutation Operator
Thomas Jansen, Dirk Sudholt
Evolutionary Computation (2010) 18 (1): 1–26.
View articletitled, Analysis of an Asymmetric Mutation Operator
Open the PDF for in another window
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Daniel Molina, Manuel Lozano, Carlos García-Martínez, Francisco Herrera
Evolutionary Computation (2010) 18 (1): 27–63.
View articletitled, Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Open the PDF for in another window
Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms
Oliver Schütze, Marco Laumanns, Emilia Tantar, Carlos A. Coello Coello, El-Ghazali Talbi
Evolutionary Computation (2010) 18 (1): 65–96.
View articletitled, Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms
Open the PDF for in another window
Adaptive Niche Radii and Niche Shapes Approaches for Niching with the CMA-ES
Ofer M. Shir, Michael Emmerich, Thomas Bäck
Evolutionary Computation (2010) 18 (1): 97–126.
View articletitled, Adaptive Niche Radii and Niche Shapes Approaches for Niching with the CMA-ES
Open the PDF for in another window
Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization
Ahmed Elhossini, Shawki Areibi, Robert Dony
Evolutionary Computation (2010) 18 (1): 127–156.
View articletitled, Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization
Open the PDF for in another window

Product(s) added to cart

Go to Cart Continue Browsing
Close Modal

Advertisement

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter Sign Up

MIT Press Direct

Information

MIT Press

Contact Us

© 2023 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept