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 26 matches
- 2016
- Tommaso Adamo, Tobia Calogiuri, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero, Emanuele Manni:
Neighborhood Synthesis from an Ensemble of MIP and CP Models. LION 2016: 221-226 - Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
Parallelizing Constraint Solvers for Hard RCPSP Instances. LION 2016: 227-233 - Alejandro Arbelaez, Barry O'Sullivan:
Learning a Stopping Criterion for Local Search. LION 2016: 3-16 - Konstantin Barkalov, Alexander Sysoyev, Ilya Lebedev, Vladislav Sovrasov:
Solving GENOPT Problems with the Use of ExaMin Solver. LION 2016: 283-295 - Nacim Belkhir, Johann Dréo, Pierre Savéant, Marc Schoenauer:
Surrogate Assisted Feature Computation for Continuous Problems. LION 2016: 17-31 - Aymeric Blot, Holger H. Hoos, Laetitia Jourdan, Marie-Éléonore Kessaci-Marmion, Heike Trautmann:
MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. LION 2016: 32-47 - Jakob Bossek, Heike Trautmann:
Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. LION 2016: 48-59 - Mauro Brunato, Roberto Battiti:
Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global Optimization. LION 2016: 60-74 - Laura Climent, Barry O'Sullivan, Steven D. Prestwich:
Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection. LION 2016: 75-90 - Robinson Duque, Juan Francisco Díaz, Alejandro Arbelaez:
Constraint Programming and Machine Learning for Interactive Soccer Analysis. LION 2016: 240-246 - Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir:
Designing and Comparing Multiple Portfolios of Parameter Configurations for Online Algorithm Selection. LION 2016: 91-106 - Lars Kotthoff, Ciaran McCreesh, Christine Solnon:
Portfolios of Subgraph Isomorphism Algorithms. LION 2016: 107-122 - Eduardo Lalla-Ruiz, Silvia Schwarze, Stefan Voß:
A Matheuristic Approach for the p-Cable Trench Problem. LION 2016: 247-252 - Marius Lindauer, Rolf-David Bergdoll, Frank Hutter:
An Empirical Study of Per-instance Algorithm Scheduling. LION 2016: 253-259 - Yuri Malitsky, Marius Merschformann, Barry O'Sullivan, Kevin Tierney:
Structure-Preserving Instance Generation. LION 2016: 123-140 - Seongsoo Moon, Mary Inaba:
Dynamic Strategy to Diversify Search Using a History Map in Parallel Solving. LION 2016: 260-266 - Lucien Mousin, Laetitia Jourdan, Marie-Éléonore Kessaci-Marmion, Clarisse Dhaenens:
Feature Selection Using Tabu Search with Learning Memory: Learning Tabu Search. LION 2016: 141-156 - Zongxu Mu, Holger H. Hoos, Thomas Stützle:
The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-Art Inexact TSP Solvers. LION 2016: 157-172 - Jakob Richter, Helena Kotthaus, Bernd Bischl, Peter Marwedel, Jörg Rahnenführer, Michel Lang:
Faster Model-Based Optimization Through Resource-Aware Scheduling Strategies. LION 2016: 267-273 - Eduardo Segredo, Eduardo Lalla-Ruiz, Emma Hart, Ben Paechter, Stefan Voß:
Hybridisation of Evolutionary Algorithms Through Hyper-heuristics for Global Continuous Optimisation. LION 2016: 296-305 - Gilles Simonin, Barry O'Sullivan:
Requests Management for Smartphone-Based Matching Applications Using a Multi-agent Approach. LION 2016: 173-186 - Teck-Hou Teng, Stephanus Daniel Handoko, Hoong Chuin Lau:
Self-organizing Neural Network for Adaptive Operator Selection in Evolutionary Search. LION 2016: 187-202 - Nguyen Dang Thi Thanh, Patrick De Causmaecker:
Characterization of Neighborhood Behaviours in a Multi-neighborhood Local Search Algorithm. LION 2016: 234-239 - Marlin W. Ulmer, Stefan Voß:
Risk-Averse Anticipation for Dynamic Vehicle Routing. LION 2016: 274-279 - Lin Xu, Ashiqur R. KhudaBukhsh, Holger H. Hoos, Kevin Leyton-Brown:
Quantifying the Similarity of Algorithm Configurations. LION 2016: 203-217 - Paola Festa, Meinolf Sellmann, Joaquin Vanschoren:
Learning and Intelligent Optimization - 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10079, Springer 2016, ISBN 978-3-319-50348-6 [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-11-17 22:21 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