Остановите войну!
for scientists:
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 205 matches
- 2013
- Markus Wagner, Frank Neumann:
A fast approximation-guided evolutionary multi-objective algorithm. GECCO 2013: 687-694 - Pedro de Lima Abrão, Elizabeth Fialho Wanner, Paulo Eduardo Maciel de Almeida:
A novel movable partitions approach with neural networks and evolutionary algorithms for solving the hydroelectric unit commitment problem. GECCO 2013: 1205-1212 - Ricardo Aler, Julia Handl, Joshua D. Knowles:
Comparing multi-objective and threshold-moving ROC curve generation for a prototype-based classifier. GECCO 2013: 1029-1036 - Aldeida Aleti, Irene Moser:
Entropy-based adaptive range parameter control for evolutionary algorithms. GECCO 2013: 1501-1508 - Carlos Eduardo de Andrade, Flávio Keidi Miyazawa, Mauricio G. C. Resende:
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. GECCO 2013: 463-470 - Dirk V. Arnold:
On the behaviour of the (1, λ)-es for a conically constrained problem. GECCO 2013: 423-430 - Aaron Atwater, Malcolm I. Heywood:
Benchmarking pareto archiving heuristics in the presence of concept drift: diversity versus age. GECCO 2013: 885-892 - Alexander Bailey, Beatrice M. Ombuki-Berman, Mario Ventresca:
Automatic inference of hierarchical graph models using genetic programming with an application to cortical networks. GECCO 2013: 893-900 - Rodrigo C. Barros, Márcio P. Basgalupp, Ricardo Cerri, Tiago Silva da Silva, André C. P. L. F. de Carvalho:
A grammatical evolution approach for software effort estimation. GECCO 2013: 1413-1420 - Nick Barton, Tiago Paixão:
Can quantitative and population genetics help us understand evolutionary computation? GECCO 2013: 1573-1580 - Tomás Bartos, Tomás Skopal, Juraj Mosko:
Efficient indexing of similarity models with inequality symbolic regression. GECCO 2013: 901-908 - Matthieu Basseur, Adrien Goëffon:
Hill-climbing strategies on various landscapes: an empirical comparison. GECCO 2013: 479-486 - Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel:
On set-based local search for multiobjective combinatorial optimization. GECCO 2013: 471-478 - Iain Bate, Mark Louis Fairbairn:
Searching for the minimum failures that can cause a hazard in a wireless sensor network. GECCO 2013: 1213-1220 - Florian Benz, Timo Kötzing:
An effective heuristic for the smallest grammar problem. GECCO 2013: 487-494 - Thomas G. van den Berg, Shimon Whiteson:
Critical factors in the performance of hyperNEAT. GECCO 2013: 759-766 - Karel P. Bergmann, Jörg Denzinger:
Testing of precision agricultural networks for adversary-induced problems. GECCO 2013: 1421-1428 - Tobias Berka, Helmut A. Mayer:
Evolving artificial neural networks for nonlinear feature construction. GECCO 2013: 1037-1044 - Josh C. Bongard, Gregory S. Hornby:
Combining fitness-based search and user modeling in evolutionary robotics. GECCO 2013: 159-166 - Mohammad Reza Bonyadi, Xiang Li, Zbigniew Michalewicz:
A hybrid particle swarm with velocity mutation for constraint optimization problems. GECCO 2013: 1-8 - Peter A. N. Bosman, Dirk Thierens:
More concise and robust linkage learning by filtering and combining linkage hierarchies. GECCO 2013: 359-366 - Mustafa Bozkurt:
Cost-aware pareto optimal test suite minimisation for service-centric systems. GECCO 2013: 1429-1436 - Karl Bringmann, Tobias Friedrich:
Parameterized average-case complexity of the hypervolume indicator. GECCO 2013: 575-582 - Andre Britto, Sanaz Mostaghim, Aurora T. R. Pozo:
Iterated multi-swarm: a multi-swarm algorithm based on archiving methods. GECCO 2013: 583-590 - Darwin Brochero, Christian Gagné, François Anctil:
Evolutionary multiobjective optimization for selecting members of an ensemble streamflow forecasting model. GECCO 2013: 1221-1228 - Tim Brys, Madalina M. Drugan, Peter A. N. Bosman, Martine De Cock, Ann Nowé:
Solving satisfiability in fuzzy logics by mixing CMA-ES. GECCO 2013: 1125-1132 - Caner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Non stationary operator selection with island models. GECCO 2013: 1509-1516 - Alexandros André Chaaraoui, Francisco Flórez-Revuelta:
Human action recognition optimization based on evolutionary feature subset selection. GECCO 2013: 1229-1236 - David Chalupa:
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms. GECCO 2013: 495-502 - Wei-Ming Chen, Chu-Yu Hsu, Tian-Li Yu, Wei-Che Chien:
Effects of discrete hill climbing on model building forestimation of distribution algorithms. GECCO 2013: 367-374
skipping 175 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-05-09 21:44 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