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 24 matches
- 2013
- Reza Abbasian, Malek Mouhoub:
A New Crossover for Solving Constraint Satisfaction Problems. EvoCOP 2013: 37-48 - Alejandro Arbelaez, Philippe Codognet:
From Sequential to Parallel Local Search for SAT. EvoCOP 2013: 157-168 - Shahriar Asta, Ender Özcan, Andrew J. Parkes, A. Sima Etaner-Uyar:
Generalizing Hyper-heuristics via Apprenticeship Learning. EvoCOP 2013: 169-178 - Una Benlic, Jin-Kao Hao:
A Study of Adaptive Perturbation Strategy for Iterated Local Search. EvoCOP 2013: 61-72 - Leonardo C. T. Bezerra, Manuel López-Ibáñez, Thomas Stützle:
An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem. EvoCOP 2013: 85-96 - Liam Cervante, Bing Xue, Lin Shang, Mengjie Zhang:
A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory. EvoCOP 2013: 25-36 - David Chalupa:
Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search. EvoCOP 2013: 238-249 - Shalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, Fabien Teytaud:
Investigating Monte-Carlo Methods on the Weak Schur Problem. EvoCOP 2013: 191-201 - Johannes Inführ, Günther R. Raidl:
Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent. EvoCOP 2013: 250-261 - Ahmed Kheiri, Ender Özcan:
A Hyper-heuristic with a Round Robin Neighbourhood Selection. EvoCOP 2013: 1-12 - Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches. EvoCOP 2013: 202-213 - Chuang Liu, Min Han:
Dynamic Evolutionary Membrane Algorithm in Dynamic Environments. EvoCOP 2013: 145-156 - Broos Maenhout, Mario Vanhoucke:
An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem. EvoCOP 2013: 97-108 - Yannis Marinakis, Magdalene Marinaki:
Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem. EvoCOP 2013: 133-144 - Yuichi Nagata, Isao Ono:
High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem. EvoCOP 2013: 179-190 - Erik Pitzer, Andreas Beham, Michael Affenzeller:
Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis. EvoCOP 2013: 109-120 - Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP 2013: 121-132 - Marc Reimann, José Eugênio Leal:
Single Line Train Scheduling with ACO. EvoCOP 2013: 226-237 - Álvaro Rubio-Largo, Miguel A. Vega-Rodríguez:
A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks. EvoCOP 2013: 13-24 - Rommel Dias Saraiva, Napoleão Nepomuceno, Plácido Rogério Pinheiro:
The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. EvoCOP 2013: 262-273 - Mihai Suciu, Denis Pallez, Marcel Cremene, Dumitru Dumitrescu:
Adaptive MOEA/D for QoS-Based Web Service Composition. EvoCOP 2013: 73-84 - Mario Ventresca, Beatrice M. Ombuki-Berman, Andrew Runka:
Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures. EvoCOP 2013: 214-225 - Wei Xiao, Wenqing Chu, Zhipeng Lü, Tao Ye, Guang Liu, Shanshan Cui:
A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs. EvoCOP 2013: 49-60 - Martin Middendorf, Christian Blum:
Evolutionary Computation in Combinatorial Optimization - 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings. Lecture Notes in Computer Science 7832, Springer 2013, ISBN 978-3-642-37197-4 [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-10-31 17:03 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