Skip to Main Content

Advertisement

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

Issues

Volume 25, Issue 3
Fall 2017
Issue Cover
All Issues
ISSN 1063-6560
EISSN 1530-9304
In this Issue
Evolving a Nelder–Mead Algorithm for Optimization with Genetic Programming
Iztok Fajfar, Janez Puhan, Árpád Bűrmen
Evolutionary Computation (2017) 25 (3): 351–373.
View articletitled, Evolving a Nelder–Mead Algorithm for Optimization with Genetic Programming
Open the PDF for in another window
Online Discovery of Search Objectives for Test-Based Problems
Paweł Liskowski, Krzysztof Krawiec
Evolutionary Computation (2017) 25 (3): 375–406.
View articletitled, Online Discovery of Search Objectives for Test-Based Problems
Open the PDF for in another window
Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty
I. Moser, M. Gheorghita, A. Aleti
Evolutionary Computation (2017) 25 (3): 407–437.
View articletitled, Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty
Open the PDF for in another window
Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations
Ali Ahrari, Kalyanmoy Deb, Mike Preuss
Evolutionary Computation (2017) 25 (3): 439–471.
View articletitled, Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations
Open the PDF for in another window
A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems
Ahmed Kheiri, Ed Keedwell
Evolutionary Computation (2017) 25 (3): 473–501.
View articletitled, A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems
Open the PDF for in another window
A Probabilistic Reformulation of No Free Lunch: Continuous Lunches Are Not Free
Alan J. Lockett, Risto Miikkulainen
Evolutionary Computation (2017) 25 (3): 503–528.
View articletitled, A Probabilistic Reformulation of No Free Lunch: Continuous Lunches Are Not Free
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