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 19 matches
- 2008
- Vittorio Maniezzo, Roberto Battiti, Jean-Paul Watson:
Learning and Intelligent Optimization, Second International Conference, LION 2007, Trento, Italy, December 8-12, 2007. Selected Papers. Lecture Notes in Computer Science 5313, Springer 2008, ISBN 978-3-540-92694-8 [contents] - 2007
- Sameh Al-Shihabi, Peter Merz, Steffen Wolf:
Nested Partitioning for the Minimum Energy Broadcast Problem. LION 2007: 1-11 - Enrico Bartolini, Vittorio Maniezzo, Aristide Mingozzi:
An Adaptive Memory-Based Approach Based on Partial Enumeration. LION 2007: 12-24 - Roberto Battiti, Mauro Brunato, Paolo Campigotto:
Learning While Optimizing an Unknown Fitness Surface. LION 2007: 25-40 - Mauro Brunato, Holger H. Hoos, Roberto Battiti:
On Effectively Finding Maximal Quasi-cliques in Graphs. LION 2007: 41-55 - Samuel Rota Bulò, Marcello Pelillo:
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs. LION 2007: 220-233 - Olivier Caelen, Gianluca Bontempi:
Improving the Exploration Strategy in Bandit Algorithms. LION 2007: 56-68 - Hadrien Cambazard, Narendra Jussien:
Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem. LION 2007: 69-80 - Yann Cooren, Amir Nakib, Patrick Siarry:
Image Thresholding Using TRIBES, a Parameter-Free Particle Swarm Optimization Algorithm. LION 2007: 81-94 - Teodor Gabriel Crainic, Michel Toulouse:
Explicit and Emergent Cooperation Schemes for Search Algorithms. LION 2007: 95-109 - Deon Garrett, Dipankar Dasgupta:
Multiobjective Landscape Analysis and the Generalized Assignment Problem. LION 2007: 110-124 - William E. Hart, Jonathan W. Berry, Erik G. Boman, Cynthia A. Phillips, Lee Ann Riesen, Jean-Paul Watson:
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks. LION 2007: 125-137 - Yannis Marinakis, Magdalene Marinaki, Nikolaos F. Matsatsinis:
A Hybrid Clustering Algorithm Based on Honey Bees Mating Optimization and Greedy Randomized Adaptive Search Procedure. LION 2007: 138-152 - Frank Neumann, Carsten Witt:
Ant Colony Optimization and the Minimum Spanning Tree Problem. LION 2007: 153-166 - Takao Ono, Mutsunori Yagiura, Tomio Hirata:
A Vector Assignment Approach for the Graph Coloring Problem. LION 2007: 167-176 - Lale Özbakir, Adil Baykasoglu, Sinem Kulluk:
Rule Extraction from Neural Networks Via Ant Colony Algorithm for Data Mining Applications. LION 2007: 177-191 - Steven D. Prestwich:
Tuning Local Search by Average-Reward Reinforcement Learning. LION 2007: 192-205 - Stephen Remde, Peter I. Cowling, Keshav P. Dahal, Nic Colledge:
Evolution of Fitness Functions to Improve Heuristic Performance. LION 2007: 206-219 - Celso Tchao, Simone L. Martins:
Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling. LION 2007: 234-242
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-23 03:14 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