Остановите войну!
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 65 matches
- 2009
- Magnus Ågren:
Memoisation for Constraint-Based Local Search. CP 2009: 119-126 - Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
On the Structure of Industrial SAT Instances. CP 2009: 127-141 - Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney:
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP 2009: 142-157 - Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Filtering Numerical CSPs Using Well-Constrained Subsystems. CP 2009: 158-172 - Philippe Baptiste:
Constraint-Based Schedulers, Do They Really Work? CP 2009: 1 - Christian Bessiere, Emmanuel Hebrard, Barry O'Sullivan:
Minimising Decision Tree Size as Combinatorial Optimisation. CP 2009: 173-187 - Ronan LeBras, Alessandro Zanarini, Gilles Pesant:
Efficient Generic Search Heuristics within the EMBP Framework. CP 2009: 539-553 - Gilles Chabert, Luc Jaulin:
Hull Consistency under Monotonicity. CP 2009: 188-195 - Gilles Chabert, Luc Jaulin, Xavier Lorca:
A Constraint on the Number of Distinct Vectors with Application to Localization. CP 2009: 196-210 - Arthur Choi, Trevor Standley, Adnan Darwiche:
Approximating Weighted Max-SAT Problems by Compensating for Relaxations. CP 2009: 211-225 - Geoffrey Chu, Peter J. Stuckey:
Minimizing the Maximum Number of Open Stacks by Customer Search. CP 2009: 242-257 - Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la Banda:
Using Relaxations in Maximum Density Still Life. CP 2009: 258-273 - Geoffrey Chu, Christian Schulte, Peter J. Stuckey:
Confidence-Based Work Stealing in Parallel Constraint Programming. CP 2009: 226-241 - Vianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon:
Constraint-Based Graph Matching. CP 2009: 274-288 - David A. Cohen, Martin James Green, Chris Houghton:
Constraint Representations and Structural Tractability. CP 2009: 289-303 - Alberto Delgado, Rune Møller Jensen, Christian Schulte:
Generating Optimal Stowage Plans for Container Vessel Bays. CP 2009: 6-20 - Iván Dotú, Pascal Van Hentenryck, Miguel A. Patricio, Antonio Berlanga, José García, José M. Molina López:
Real-Time Tabu Search for Video Tracking Association. CP 2009: 21-34 - Bella Dubrov, Haggai Eran, Ari Freund, Edward F. Mark, Shyam Ramji, Timothy A. Schell:
Pin Assignment Using Stochastic Local Search Constraint Programming. CP 2009: 35-49 - Redouane Ezzahir, Christian Bessiere, Mohamed Wahbi, Imade Benelallam, Houssine Bouyakhf:
Asynchronous Inter-Level Forward-Checking for DisCSPs. CP 2009: 304-318 - François Fages, Aurélien Rizk:
From Model-Checking to Temporal Logic Constraint Solving. CP 2009: 319-334 - Aurélie Favier, Simon de Givry, Philippe Jégou:
Exploiting Problem Structure for Solution Counting. CP 2009: 335-343 - Mohammad M. Fazel-Zarandi, J. Christopher Beck:
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition. CP 2009: 344-351 - Thibaut Feydy, Peter J. Stuckey:
Lazy Clause Generation Reengineered. CP 2009: 352-366 - Alan M. Frisch, Peter J. Stuckey:
The Proper Treatment of Undefinedness in Constraint Languages. CP 2009: 367-382 - Alex S. Fukunaga:
Search Spaces for Min-Perturbation Repair. CP 2009: 383-390 - Carla P. Gomes:
Challenges for Constraint Reasoning and Optimization in Computational Sustainability. CP 2009: 2-4 - Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
Snake Lex: An Alternative to Double Lex. CP 2009: 391-399 - Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert:
Closing the Open Shop: Contradicting Conventional Wisdom. CP 2009: 400-408 - Tarik Hadzic, Alan Holland, Barry O'Sullivan:
Reasoning about Optimal Collections of Solutions. CP 2009: 409-423 - Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon:
Constraints of Difference and Equality: A Complete Taxonomic Characterisation. CP 2009: 424-438
skipping 35 more matches
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-30 13:25 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