![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 42 matches
- 1999
- Slim Abdennadher, Thom W. Frühwirth:
Operational Equivalence of CHR Programs and Constraints. CP 1999: 43-57 - Krzysztof R. Apt:
The Rough Guide to Constraint Propagation. CP 1999: 1-23 - Krzysztof R. Apt, Éric Monfroy:
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. CP 1999: 58-72 - Rolf Backofen, Sebastian Will:
Excluding Symmetries in Constraint-Based Search. CP 1999: 73-87 - Christian Bessière:
Non-Binary Constraints. CP 1999: 24-27 - Christian Bessière, Pedro Meseguer, Eugene C. Freuder, Javier Larrosa:
On Forward Checking for Non-binary Constraint Satisfaction. CP 1999: 88-102 - Christian Bessière, Jean-Charles Régin:
Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly. CP 1999: 103-117 - Marcus Bjäreland, Peter Jonsson:
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. CP 1999: 118-128 - Mathias Broxvall, Peter Jonsson:
Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. CP 1999: 129-143 - Stanislav Busygin:
On SAT01 Problem. CP 1999: 476-477 - Yves Caseau, François Laburthe, Glenn Silverstein:
A Meta-Heuristic Factory for Vehicle Routing Problems. CP 1999: 144-158 - Jorge Cruz
, Pedro Barahona
:
An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support. CP 1999: 478-479 - Víctor Dalmau
, Justin Pearson:
Closure Functions and Width 1 Problems. CP 1999: 159-173 - Bart Demoen, Maria J. García de la Banda
, Warwick Harvey, Kim Marriott, Peter J. Stuckey:
An Overview of HAL. CP 1999: 174-188 - Filippo Focacci, Andrea Lodi, Michela Milano:
Cost-Based Domain Filtering. CP 1999: 189-203 - Christian Frei, Boi Faltings:
Resource Allocation and Constraint Satisfaction Techniques. CP 1999: 204-218 - Ian P. Gent, Toby Walsh:
CSPLIB: A Benchmark Library for Constraints. CP 1999: 480-481 - Youssef Hamadi:
Optimal Distributed Arc-Consistency. CP 1999: 219-233 - Timothy J. Hickey, David K. Wittenberg:
Validated Constraint Compilation. CP 1999: 482-483 - Tudor Hulubei, Eugene C. Freuder:
The Goldilocks Problem. CP 1999: 234-245 - Ortrun Ibes:
Automated Theorem Proving with Disjunctive Constraints. CP 1999: 484-485 - Micha Janssen, Yves Deville
, Pascal Van Hentenryck:
Multistep Filtering Operators for Ordinary Differential Equations. CP 1999: 246-260 - Ulrich Junker
, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle, Meinolf Sellmann:
A Framework for Constraint Programming Based Column Generation. CP 1999: 261-274 - Kazuya Kaneko, Masazumi Yoshikawa, Yoichiro Nakakuki:
Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems. CP 1999: 275-288 - Ludwig Krippahl
, Pedro Barahona
:
Applying Constraint Programming to Protein Structure Determination. CP 1999: 289-302 - Javier Larrosa, Pedro Meseguer:
Partition-Based Lower Bound for Max-CSP. CP 1999: 303-315 - Claudio Lottaz:
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms. CP 1999: 486-487 - Bernd Meyer:
Constraint Diagram Reasoning. CP 1999: 316-330 - François Pachet, Pierre Roy:
Automatic Generation of Music Programs. CP 1999: 331-345 - Laurent Perron:
Search Procedures and Parallelism in Constraint Programming. CP 1999: 346-360
skipping 12 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-09 23:30 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