Остановите войну!
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 25 matches
- 2010
- Salwani Abdullah, Khalid Shaker, Barry McCollum, Paul McMullan:
Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling. EvoCOP 2010: 1-10 - Ekaterina Alekseeva, Nina Kochetova, Yury Kochetov, Alexander V. Plyasunov:
Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem. EvoCOP 2010: 11-22 - Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal:
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme. EvoCOP 2010: 23-34 - Dilip Datta, José Rui Figueira:
A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study. EvoCOP 2010: 35-46 - Botond Draskoczy:
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems. EvoCOP 2010: 47-58 - Greg Durrett, Muriel Médard, Una-May O'Reilly:
A Genetic Algorithm to Minimize Chromatic Entropy. EvoCOP 2010: 59-70 - Marcus Furuholmen, Kyrre Glette, Mats Høvin, Jim Tørresen:
Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings. EvoCOP 2010: 71-82 - Daniel Lombraña Gonzalez, Juan Luis Jiménez Laredo, Francisco Fernández de Vega, Juan Julián Merelo Guervós:
Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems. EvoCOP 2010: 131-142 - Evren Güney, I. Kuban Altinel, Necati Aras, Cem Ersoy:
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks. EvoCOP 2010: 83-94 - Thomas Hammerl, Nysret Musliu:
Ant Colony Optimization for Tree Decompositions. EvoCOP 2010: 95-106 - Edmar Hell Kamke, José Elias Claudio Arroyo, André Gustavo dos Santos:
Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times. EvoCOP 2010: 107-118 - Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol:
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures. EvoCOP 2010: 119-130 - Rui Lopes, Daniela Girimonte:
The Office-Space-Allocation Problem in Strongly Hierarchized Organizations. EvoCOP 2010: 143-153 - Zhipeng Lü, Jin-Kao Hao, Fred W. Glover:
A Study of Memetic Search with Multi-parent Combination for UBQP. EvoCOP 2010: 154-165 - Thé Van Luong, Nouredine Melab, El-Ghazali Talbi:
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem. EvoCOP 2010: 264-275 - Mohammad Mesgarpour, Nureddin Kirkavak, Hakan Özaktas:
Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing. EvoCOP 2010: 166-177 - David Millán-Ruiz, José Ignacio Hidalgo:
A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres. EvoCOP 2010: 178-189 - Alberto Moraglio, Colin G. Johnson:
Geometric Generalization of the Nelder-Mead Algorithm. EvoCOP 2010: 190-201 - Yuichi Nagata, Shigenobu Kobayashi:
Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. EvoCOP 2010: 202-213 - Eunice Oliveira, Carlos Henggeler Antunes:
An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles. EvoCOP 2010: 214-225 - Sandro Pirkwieser, Günther R. Raidl:
Multilevel Variable Neighborhood Search for Periodic Routing Problems. EvoCOP 2010: 226-238 - Günther R. Raidl, Bin Hu:
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. EvoCOP 2010: 239-251 - Madalina Raschip, Cornelius Croitoru:
A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem. EvoCOP 2010: 252-263 - Steffen Wolf, Peter Merz:
Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem. EvoCOP 2010: 276-287 - Peter I. Cowling, Peter Merz:
Evolutionary Computation in Combinatorial Optimization, 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010. Proceedings. Lecture Notes in Computer Science 6022, Springer 2010, ISBN 978-3-642-12138-8 [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-05-23 09:48 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