Skip to Main Content

Advertisement

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

Issues

Volume 26, Issue 3
Fall 2018
Issue Cover
All Issues
ISSN 1063-6560
EISSN 1530-9304

Extended Papers Invited from GECCO 2017 (Berlin)

Emergent Solutions to High-Dimensional Multitask Reinforcement Learning
Stephen Kelly, Malcolm I. Heywood
Evolutionary Computation (2018) 26 (3): 347–380.
View articletitled, Emergent Solutions to High-Dimensional Multitask Reinforcement Learning
Open the PDF for in another window
Data-Efficient Design Exploration through Surrogate-Assisted Illumination
Adam Gaier, Alexander Asteroth, Jean-Baptiste Mouret
Evolutionary Computation (2018) 26 (3): 381–410.
View articletitled, Data-Efficient Design Exploration through Surrogate-Assisted Illumination
Open the PDF for in another window
How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison
Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima
Evolutionary Computation (2018) 26 (3): 411–440.
View articletitled, How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison
Open the PDF for in another window
Counterexample-Driven Genetic Programming: Heuristic Program Synthesis from Formal Specifications
Iwo Błądek, Krzysztof Krawiec, Jerry Swan
Evolutionary Computation (2018) 26 (3): 441–469.
View articletitled, Counterexample-Driven Genetic Programming: Heuristic Program Synthesis from Formal Specifications
Open the PDF for in another window

Regular Papers

Exploiting Linkage Information and Problem-Specific Knowledge in Evolutionary Distribution Network Expansion Planning
Ngoc Hoang Luong, Han La Poutré, Peter A. N. Bosman
Evolutionary Computation (2018) 26 (3): 471–505.
View articletitled, Exploiting Linkage Information and Problem-Specific Knowledge in Evolutionary Distribution Network Expansion Planning
Open the PDF for in another window
Decomposition Algorithms for a Multi-Hard Problem
M. R. Przybylek, A. Wierzbicki, Z. Michalewicz
Evolutionary Computation (2018) 26 (3): 507–533.
View articletitled, Decomposition Algorithms for a Multi-Hard Problem
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