![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Evolutionary Computation, Volume 25
Volume 25, Number 1, Spring 2017
- Mohammad Reza Bonyadi
, Zbigniew Michalewicz
:
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review. 1-54 - Nadia Boukhelifa, Anastasia Bezerianos
, Waldo Cancino Ticona, Evelyne Lutton
:
Evolutionary Visual Exploration: Evaluation of an IEC Framework for Guided Visual Search. 55-86 - Mehrdad Amirghasemi
, Reza Zamani:
An Effective Evolutionary Hybrid for Solving the Permutation Flowshop Scheduling Problem. 87-111 - Antoine S. D. Dymond
, Schalk Kok
, P. Stephan Heyns:
MOTA: A Many-Objective Tuning Algorithm Specialized for Tuning under Multiple Objective Function Evaluation Budgets. 113-141 - Ilya Loshchilov:
LM-CMA: An Alternative to L-BFGS for Large-Scale Black Box Optimization. 143-171
Volume 25, Number 2, Summer 2017
- Muhammad Iqbal, Will N. Browne
, Mengjie Zhang:
Extending XCS with Cyclic Graphs for Scalability on Complex Boolean Problems. 173-204 - Alberto Moraglio, Dirk Sudholt:
Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search. 205-236 - Dirk Sudholt:
How Crossover Speeds up Building Block Assembly in Genetic Algorithms. 237-274 - Jorge C. Gomes
, Pedro Mariano
, Anders Lyhne Christensen
:
Novelty-Driven Cooperative Coevolution. 275-307 - Rubén Saborido
, Ana Belen Ruiz
, Mariano Luque:
Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front. 309-349
Volume 25, Number 3, Fall 2017
- Iztok Fajfar, Janez Puhan, Árpád Bürmen:
Evolving a Nelder-Mead Algorithm for Optimization with Genetic Programming. 351-373 - Pawel Liskowski, Krzysztof Krawiec
:
Online Discovery of Search Objectives for Test-Based Problems. 375-406 - Irene Moser, Marius Gheorghita, Aldeida Aleti
:
Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty. 407-437 - Ali Ahrari
, Kalyanmoy Deb, Mike Preuss
:
Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations. 439-471 - Ahmed Kheiri
, Ed Keedwell:
A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems. 473-501 - Alan J. Lockett, Risto Miikkulainen:
A Probabilistic Reformulation of No Free Lunch: Continuous Lunches Are Not Free. 503-528
Volume 25, Number 4, Winter 2017
- Mario A. Muñoz
, Kate Amanda Smith-Miles
:
Performance Analysis of Continuous Black-Box Optimization Algorithms via Footprints in Instance Space. - Fabio Daolio, Arnaud Liefooghe
, Sébastien Vérel
, Hernán E. Aguirre, Kiyoshi Tanaka:
Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes. - Carola Doerr
, Johannes Lengler
:
Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms? - Md. Monjurul Islam, Hemant Kumar Singh
, Tapabrata Ray
, Ankur Sinha:
An Enhanced Memetic Algorithm for Single-Objective Bilevel Optimization Problems. - Konrad Gizynski
, Gerd Gruenert, Peter Dittrich, Jerzy Gorecki
:
Evolutionary Design of Classifiers Made of Droplets Containing a Nonlinear Chemical Medium. - Samadhi Nallaperuma, Frank Neumann
, Dirk Sudholt:
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. - Xinsheng Lai, Yuren Zhou, Xiaoyun Xia
, Qingfu Zhang:
Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.