![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 68 matches
- 2006
- Magnus Ågren, Pierre Flener, Justin Pearson:
Inferring Variable Conflicts for Local Search. CP 2006: 665-669 - Shabbir Ahmed
:
Global Optimization of Probabilistically Constrained Linear Programs. CP 2006: 1 - Krzysztof R. Apt, Sebastian Brand:
Infinite Qualitative Simulations by Means of Constraint Programming. CP 2006: 29-43 - Thanasis Balafoutis, Kostas Stergiou:
Algorithms for Stochastic CSPs. CP 2006: 44-58 - Maria J. García de la Banda, Kim Marriott, Reza Rafeh, Mark Wallace
:
The Modelling Language Zinc. CP 2006: 700-705 - Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
, Thierry Petit:
Graph Properties Based Filtering. CP 2006: 59-74 - Belaid Benhamou, Mohamed Réda Saïdi:
Reasoning by Dominance in Not-Equals Binary Constraint Networks. CP 2006: 670-674 - Christian Bessiere, Emmanuel Hebrard
, Brahim Hnich
, Zeynep Kiziltan, Toby Walsh:
The ROOTS Constraint. CP 2006: 75-90 - Ismel Brito, Pedro Meseguer:
Distributed Stable Matching Problems with Ties and Incomplete Lists. CP 2006: 675-679 - Alexander Brodsky, Hadon Nash:
CoJava: Optimization Modeling by Nondeterministic Simulation. CP 2006: 91-106 - David A. Cohen, Martin C. Cooper, Peter Jeavons:
An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 - David A. Cohen, Martin James Green:
Typed Guarded Decompositions for Constraint Satisfaction. CP 2006: 122-136 - Martin C. Cooper
, Sylvain Cussat-Blanc, Marie de Roquemaurel, Pierre Régnier:
Soft Arc Consistency Applied to Optimal Planning. CP 2006: 680-684 - Yannis Dimopoulos, Kostas Stergiou:
Propagation in CSP and SAT. CP 2006: 137-151 - Grégoire Dooms, Irit Katriel:
The Minimum Spanning Tree Constraint. CP 2006: 152-166 - Iván Dotú, Pascal Van Hentenryck:
A Note on Low Autocorrelation Binary Sequences. CP 2006: 685-689 - Alex Ferguson, Barry O'Sullivan:
Relaxations and Explanations for Quantified Constraint Satisfaction Problems. CP 2006: 690-694 - Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking. CP 2006: 695-699 - Matteo Gagliolo
, Jürgen Schmidhuber:
Impact of Censored Sampling on the Performance of Restart Strategies. CP 2006: 167-181 - Ian P. Gent, Christopher Jefferson
, Ian Miguel
:
Watched Literals for Constraint Propagation in Minion. CP 2006: 182-197 - Vibhav Gogate, Rina Dechter:
A New Algorithm for Sampling CSP Solutions Uniformly at Random. CP 2006: 711-715 - Alexandre Goldsztejn, Luc Jaulin:
Inner and Outer Approximations of Existentially Quantified Equality Constraints. CP 2006: 198-212 - Santiago Macho González, Carlos Ansótegui, Pedro Meseguer:
Boosting Open CSPs. CP 2006: 314-328 - Fabrizio Grandoni, Giuseppe F. Italiano:
Algorithms and Constraint Programming. CP 2006: 2-14 - Jean-Philippe Hamiez, Jin-Kao Hao:
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib. CP 2006: 716-720 - Daniel S. Heller, Meinolf Sellmann:
Dynamic Symmetry Breaking Restarted. CP 2006: 721-725 - Pascal Van Hentenryck, Laurent Michel:
Differentiable Invariants. CP 2006: 604-619 - Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal:
Revisiting the Sequence Constraint. CP 2006: 620-634 - Chris Houghton, David A. Cohen, Martin James Green:
The Effect of Constraint Representation on Structural Tractability. CP 2006: 726-730 - Tudor Hulubei, Barry O'Sullivan:
Failure Analysis in Backtrack Search for Constraint Satisfaction. CP 2006: 731-735
skipping 38 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-23 04:48 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