![](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
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 20 matches
- 2012
- Jin-Kao Hao, Pierrick Legrand, Pierre Collet, Nicolas Monmarché, Evelyne Lutton
, Marc Schoenauer:
Artificial Evolution - 10th International Conference, Evolution Artificielle, EA 2011, Angers, France, October 24-26, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7401, Springer 2012, ISBN 978-3-642-35532-5 [contents] - 2011
- Dogan Aydin
, Tianjun Liao, Marco Antonio Montes de Oca, Thomas Stützle
:
Improving Performance via Population Growth and Local Search: The Case of the Artificial Bee Colony Algorithm. Artificial Evolution 2011: 85-96 - Amine M. Boumaza:
Reducing the Learning Time of Tetris in Evolution Strategies. Artificial Evolution 2011: 193-204 - Mátyás Brendel, Marc Schoenauer
:
Learn-and-Optimize: A Parameter Tuning Framework for Evolutionary AI Planning. Artificial Evolution 2011: 145-155 - Alan Díaz-Manríquez
, Gregorio Toscano Pulido
, Ricardo Landa Becerra:
A Surrogate-Based Intelligent Variation Operator for Multiobjective Optimization. Artificial Evolution 2011: 13-24 - Benjamin Doerr, Carola Winzen:
Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes. Artificial Evolution 2011: 205-216 - Ivanoe De Falco
, Antonio Della Cioppa
, Domenico Maisto
, Umberto Scafuri, Ernesto Tarantino
:
A Model Based on Biological Invasions for Island Evolutionary Algorithms. Artificial Evolution 2011: 157-168 - Viviane Grunert da Fonseca
, Carlos M. Fonseca
:
The Relationship between the Covered Fraction, Completeness and Hypervolume Indicators. Artificial Evolution 2011: 25-36 - Vincent van der Goes:
Adaptive Play in a Pollution Bargaining Game. Artificial Evolution 2011: 133-144 - Jorge Sebastian Hernández-Domínguez, Gregorio Toscano Pulido
, Carlos A. Coello Coello
:
A Multi-objective Particle Swarm Optimizer Enhanced with a Differential Evolution Scheme. Artificial Evolution 2011: 169-180 - Robert-Jan Huijsman, Evert Haasdijk
, A. E. Eiben:
An On-Line On-Board Distributed Algorithm for Evolutionary Robotics. Artificial Evolution 2011: 73-84 - Benjamin Inden, Yaochu Jin
, Robert Haschke
, Helge J. Ritter:
Evolution of Multisensory Integration in Large Neural Fields. Artificial Evolution 2011: 181-192 - Evelyne Lutton
, Julie Foucquier, Nathalie Perrot
, Jean Louchet, Jean-Daniel Fekete:
Visual Analysis of Population Scatterplots. Artificial Evolution 2011: 61-72 - Ogier Maitre, Nicolas Lachiche
, Pierre Collet:
Two Ports of a Full Evolutionary Algorithm onto GPGPU. Artificial Evolution 2011: 97-108 - Michalis Mavrovouniotis
, Shengxiang Yang
:
An Immigrants Scheme Based on Environmental Information for Ant Colony Optimization for the Dynamic Travelling Salesman Problem. Artificial Evolution 2011: 1-12 - Denis Robilliard, Cyril Fonlupt
, Virginie Marion-Poty, Amine M. Boumaza:
A Multilevel Tabu Search with Backtracking for Exploring Weak Schur Numbers. Artificial Evolution 2011: 109-119 - Robin Roche
, Lhassane Idoumghar, Benjamin Blunier, Abdellatif Miraoui:
Imperialist Competitive Algorithm for Dynamic Optimization of Economic Dispatch in Power Systems. Artificial Evolution 2011: 217-228 - Eduardo Rodriguez-Tello
, Luis Carlos Betancourt:
An Improved Memetic Algorithm for the Antibandwidth Problem. Artificial Evolution 2011: 121-132 - Marc Schoenauer
, Fabien Teytaud, Olivier Teytaud:
A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize. Artificial Evolution 2011: 37-48 - Sébastien Vérel
, Fabio Daolio, Gabriela Ochoa
, Marco Tomassini:
Local Optima Networks with Escape Edges. Artificial Evolution 2011: 49-60
loading more results
failed to load more results, please try again later
![](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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-26 16:38 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint