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 135 matches
- 2021
- Anirban Mukhopadhyay, L. Darrell Whitley, Renato Tinós:
An efficient implementation of iterative partial transcription for the traveling salesman problem. GECCO 2021: 252-260 - Weijie Zheng, Qiaozhi Zhang, Huanhuan Chen, Xin Yao:
When non-elitism meets time-linkage problems. GECCO 2021: 741-749 - Youhei Akimoto:
Saddle point optimization with approximate minimization oracle. GECCO 2021: 493-501 - Guilherme Seidyo Imai Aldeia, Fabrício Olivetti de França:
Measuring feature importance of symbolic regression models using partial effects. GECCO 2021: 750-758 - Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. GECCO 2021: 1115-1123 - Mazhar Ansari Ardeh, Yi Mei, Mengjie Zhang:
A novel multi-task genetic programming approach to uncertain capacitated Arc routing problem. GECCO 2021: 759-767 - Francisco Baeta, João Correia, Tiago Martins, Penousal Machado:
Speed benchmarking of genetic programming frameworks. GECCO 2021: 768-775 - Henry Bambury, Antoine Bultel, Benjamin Doerr:
Generalized jump functions. GECCO 2021: 1124-1132 - Uwe Bauknecht:
A genetic algorithm approach to virtual topology design for multi-layer communication networks. GECCO 2021: 928-936 - Riade Benbaki, Ziyad Benomar, Benjamin Doerr:
A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima. GECCO 2021: 4-13 - Julian Blank, Kalyanmoy Deb:
PSAF: a probabilistic surrogate-assisted framework for single-objective optimization. GECCO 2021: 652-659 - Aurélie Boisbunon, Carlo Fanara, Ingrid Grenet, Jonathan Daeden, Alexis Vighi, Marc Schoenauer:
Zoetrope genetic programming for regression. GECCO 2021: 776-784 - Jakob Bossek, Frank Neumann:
Evolutionary diversity optimization and the minimum spanning tree problem. GECCO 2021: 198-206 - Jakob Bossek, Aneta Neumann, Frank Neumann:
Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. GECCO 2021: 556-564 - Maximilian Böther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, Tobias Friedrich:
Evolutionary minimization of traffic congestion. GECCO 2021: 937-945 - Maxim Buzdalov, Carola Doerr:
Optimal static mutation strength distributions for the (1 + λ) evolutionary algorithm on OneMax. GECCO 2021: 660-668 - Benjamin Capps, Jacob Schrum:
Using multiple generative adversarial networks to build better-connected levels for mega man. GECCO 2021: 66-74 - Rui P. Cardoso, Emma Hart, David Burth Kurka, Jeremy V. Pitt:
Using novelty search to explicitly create diversity in ensembles of classifiers. GECCO 2021: 849-857 - Claude Carlet, Domagoj Jakobovic, Stjepan Picek:
Evolutionary algorithms-assisted construction of cryptographic boolean functions. GECCO 2021: 565-573 - Leo Cazenille:
Ensemble feature extraction for multi-container quality-diversity algorithms. GECCO 2021: 75-83 - Francisco Chicano, Gabriela Ochoa, Marco Tomassini:
Real-like MAX-SAT instances and the landscape structure across the phase transition. GECCO 2021: 207-215 - Tae Jong Choi, Julian Togelius:
Self-referential quality diversity through differential MAP-Elites. GECCO 2021: 502-509 - Antoine Cully:
Multi-emitter MAP-elites: improving quality, diversity and data efficiency with heterogeneous sets of emitters. GECCO 2021: 84-92 - Marcin Czajkowski, Krzysztof Jurczuk, Marek Kretowski:
Accelerated evolutionary induction of heterogeneous decision trees for gene expression-based classification. GECCO 2021: 946-954 - Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. GECCO 2021: 1133-1141 - Souvik Das, Anirudh Shankar, Vaneet Aggarwal:
Training spiking neural networks with a multi-agent evolutionary robotics framework. GECCO 2021: 858-865 - Bilel Derbel, Lorenzo Canonne:
A graph coloring based parallel hill climber for large-scale NK-landscapes. GECCO 2021: 216-224 - Quoc Trung Dinh, Duc Dong Do, Minh Hoàng Hà:
Ants can solve the parallel drone scheduling traveling salesman problem. GECCO 2021: 14-21 - Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of evolutionary diversity optimisation for permutation problems. GECCO 2021: 574-582 - Benjamin Doerr, Timo Kötzing:
Lower bounds from fitness levels made easy. GECCO 2021: 1142-1150
skipping 105 more matches
loading more results
failed to load more results, please try again later
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-12-21 06:02 CET 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