Остановите войну!
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
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 25 matches
- 2008
- Lourdes Araujo, José R. Pérez-Agüera:
Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach. EvoCOP 2008: 182-193 - Mohamed Bahy Bader-El-Den, Riccardo Poli:
Inc*: An Incremental Approach for Improving Local Search Heuristics. EvoCOP 2008: 194-205 - Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke, Katharina Gerhardt, Stephan Westphal, Peter Merz:
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. EvoCOP 2008: 158-169 - Christian Blum, Joaquín Bautista, Jordi Pereira:
An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem. EvoCOP 2008: 85-96 - Noureddine Bouhmala, Ole-Christoffer Granmo:
Solving Graph Coloring Problems Using Learning Automata. EvoCOP 2008: 277-288 - Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena:
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem. EvoCOP 2008: 123-134 - Bart G. W. Craenen, Ben Paechter:
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems. EvoCOP 2008: 13-24 - Keshav P. Dahal, Stephen Remde, Peter I. Cowling, Nic Colledge:
Improving Metaheuristic Performance by Evolving a Variable Fitness Function. EvoCOP 2008: 170-181 - Isabelle Devarenne, Hakim Mabed, Alexandre Caminada:
Adaptive Tabu Tenure Computation in Local Search. EvoCOP 2008: 1-12 - Laura Diosan, Alexandrina Rogozan, Jean-Pierre Pécuchet:
Optimising Multiple Kernels for SVM by Genetic Programming. EvoCOP 2008: 230-241 - Hideki Hashimoto, Mutsunori Yagiura:
A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows. EvoCOP 2008: 254-265 - Bin Hu, Günther R. Raidl:
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP 2008: 36-47 - Celso Y. Ishida, Andre B. de Carvalho, Aurora Trinidad Ramirez Pozo, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
Exploring Multi-objective PSO and GRASP-PR for Rule Induction. EvoCOP 2008: 73-84 - István Juhos, Jano I. van Hemert:
Graph Colouring Heuristics Guided by Higher Order Graph Properties. EvoCOP 2008: 97-109 - Jirí Kubalík, Richard Mordinyi, Stefan Biffl:
Multiobjective Prototype Optimization with Evolved Improvement Steps. EvoCOP 2008: 218-229 - Renaud Lenne, Christine Solnon, Thomas Stützle, Eric Tannier, Mauro Birattari:
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem. EvoCOP 2008: 266-276 - Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. Burke:
Metaheuristics for the Bi-objective Ring Star Problem. EvoCOP 2008: 206-217 - Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz Antonio Nogueira Lorena:
A Hybrid Column Generation Approach for the Berth Allocation Problem. EvoCOP 2008: 110-122 - Ammar W. Mohemmed, Mengjie Zhang, Nirod Chandra Sahoo:
Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem. EvoCOP 2008: 25-35 - Yuichi Nagata, Olli Bräysy:
Efficient Local Search Limitation Strategies for Vehicle Routing Problems. EvoCOP 2008: 48-60 - Anand Subramanian, Lucídio dos Anjos Formiga Cabral:
An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit. EvoCOP 2008: 135-146 - Luigi Troiano, Cosimo Birtolo, Roberto Armenise, Gennaro Cirillo:
Optimization of Menu Layouts by Means of Genetic Algorithms. EvoCOP 2008: 242-253 - Steffen Wolf, Peter Merz:
Evolutionary Local Search for the Minimum Energy Broadcast Problem. EvoCOP 2008: 61-72 - Rui Zhang, Cheng Wu:
An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem. EvoCOP 2008: 147-157 - Jano I. van Hemert, Carlos Cotta:
Evolutionary Computation in Combinatorial Optimization, 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings. Lecture Notes in Computer Science 4972, Springer 2008, ISBN 978-3-540-78603-0 [contents]
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-04-25 16:01 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