![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
11. EA 2013: Bordeaux, France
- Pierrick Legrand, Marc-Michel Corsini, Jin-Kao Hao, Nicolas Monmarché, Evelyne Lutton
, Marc Schoenauer:
Artificial Evolution - 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21-23, 2013. Revised Selected Papers. Lecture Notes in Computer Science 8752, Springer 2014, ISBN 978-3-319-11682-2
Theory
- Arnaud Liefooghe
, Sébastien Vérel
, Hernán E. Aguirre, Kiyoshi Tanaka:
What Makes an Instance Difficult for Black-Box 0-1 Evolutionary Multiobjective Optimizers? 3-15 - Sandra Astete Morales, Jialin Liu
, Olivier Teytaud:
Log-log Convergence for Noisy Optimization. 16-28 - Charlie Vanaret
, Jean-Baptiste Gotteland, Nicolas Durand
, Jean-Marc Alliot
:
Preventing Premature Convergence and Proving the Optimality in Evolutionary Algorithms. 29-40 - Fabio Daolio, Sébastien Vérel
, Gabriela Ochoa
, Marco Tomassini:
Local Optima Networks of the Permutation Flow-Shop Problem. 41-52 - Jérémie Decock, Olivier Teytaud:
Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functions. 53-64
Ant Colony Optimization
- Leonor Albuquerque Melo, Francisco B. Pereira, Ernesto Costa:
Effective Multi-caste Ant Colony System for Large Dynamic Traveling Salesperson Problems. 67-78 - Christian Blum
, Maria J. Blesa
, Borja Calvo
:
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. 79-90
Applications
- Hoang N. Luong
, Marinus O. W. Grond, Peter A. N. Bosman, Han La Poutré:
Medium-Voltage Distribution Network Expansion Planning with Gene-pool Optimal Mixing Evolutionary Algorithms. 93-105 - Khedidja Seridi, Laetitia Jourdan
, El-Ghazali Talbi:
Preliminary Studies on Biclustering of GWA: A Multiobjective Approach. 106-117 - Alina Mereuta, Sebastien Aupetit, Nicolas Monmarché, Mohamed Slimane:
An Evolutionary Approach to Contrast Compensation for Dichromat Users. 118-128 - Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins
:
Multistart Evolutionary Local Search for a Disaster Relief Problem. 129-141
Combinatorial and Discrete Optimization
- Olivier Gach, Jin-Kao Hao:
Improving the Louvain Algorithm for Community Detection with Modularity Maximization. 145-156 - Inès Sghir, Jin-Kao Hao, Inès Ben Jaâfar, Khaled Ghédira:
A Recombination-Based Tabu Search Algorithm for the Winner Determination Problem. 157-167 - Fazia Aboud, Nathalie Grangeon, Sylvie Norre:
Improving Efficiency of Metaheuristics for Cellular Automaton Inverse Problem. 168-179
Memetic Algorithms
- Rym Nesrine Guibadj, Aziz Moukrim
:
Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows. 183-194
Genetic Programming
- Nuno Lourenço
, Francisco B. Pereira, Ernesto Costa:
Learning Selection Strategies for Evolutionary Algorithms. 197-208
Interactive Evolution
- Alberto Paolo Tonda, Andre Suslik Spritzer, Evelyne Lutton
:
Balancing User Interaction and Control in BNSL. 211-223
Parallel Evolutionary Algorithms
- Frédéric Krüger, Daniel Wagner, Pierre Collet:
Massively Parallel Generational GA on GPGPU Applied to Power Load Profiles Determination. 227-239
Swarm Intelligence
- Piero Consoli, Mario Pavone
:
O-BEE-COL: Optimal BEEs for COLoring Graphs. 243-255 - Alejandro Lopez Rincon
, Miguel Cienfuegos, Bedr'Eddine Ainseba
, Mostafa Bendahmane:
PSO with Tikhonov Regularization for the Inverse Problem in Electrocardiography. 256-270
![](https://dblp1.uni-trier.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.