Остановите войну!
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 68 matches
- 2007
- Henrik Reif Andersen, Tarik Hadzic, John N. Hooker, Peter Tiedemann:
A Constraint Store Based on Multivalued Decision Diagrams. CP 2007: 118-132 - Vicente Ruiz de Angulo, Carme Torras:
Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms. CP 2007: 864-871 - Fahiem Bacchus:
Caching in Backtracking Search. CP 2007: 1 - Fahiem Bacchus:
GAC Via Unit Propagation. CP 2007: 133-147 - Fahiem Bacchus, Kostas Stergiou:
Solution Directed Backjumping for QCSP. CP 2007: 148-163 - Kenneth M. Bayer, Martin Michalowski, Berthe Y. Choueiry, Craig A. Knoblock:
Reformulating CSPs for Scalability with Application to Geospatial Reasoning. CP 2007: 164-179 - Grégory Beaumet, Gérard Verfaillie, Marie-Claire Charmeau:
Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite. CP 2007: 3-17 - Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder, R. Sadek, Charlotte Truchet:
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects. CP 2007: 180-194 - Belaid Benhamou, Mohamed Réda Saïdi:
Local Symmetry Breaking During Search in CSPs. CP 2007: 195-209 - Stefano Bistarelli, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Uncertainty in Bipolar Preference Problems. CP 2007: 782-789 - Stefano Bistarelli, Pamela Peretti, Irina Trubitsyna:
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario. CP 2007: 773-781 - Lucas Bordeaux, Youssef Hamadi, Moshe Y. Vardi:
An Analysis of Slow Convergence in Interval Propagation. CP 2007: 790-797 - Sebastian Brand, Nina Narodytska, Claude-Guy Quimper, Peter J. Stuckey, Toby Walsh:
Encodings of the Sequence Constraint. CP 2007: 210-224 - Menkes van den Briel, J. Benton, Subbarao Kambhampati, Thomas Vossen:
An LP-Based Heuristic for Optimal Planning. CP 2007: 651-665 - Raphaël Chenouard, Patrick Sébastian, Laurent Granvilliers:
Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques. CP 2007: 18-32 - Chiu Wo Choi, Jimmy Ho-Man Lee:
Solving the Salinity Control Problem in a Potable Water System. CP 2007: 33-48 - David A. Cohen, Peter Jeavons, Stanislav Zivný:
The Expressive Power of Valued Constraints: Hierarchies and Collapses. CP 2007: 798-805 - Hélène Collavizza, Michel Rueher:
Exploring Different Constraint-Based Modelings for Program Verification. CP 2007: 49-63 - Jean-François Condotta, Gérard Ligozat, Mahmoud Saade:
Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks. CP 2007: 806-814 - Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li:
On Inconsistent Clause-Subsets for Max-SAT Solving. CP 2007: 225-240 - Andrew J. Davenport, Jayant Kalagnanam, Chandra Reddy, Stuart Siegel, John Hou:
An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing. CP 2007: 64-76 - Tristan Denmat, Arnaud Gotlieb, Mireille Ducassé:
An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming. CP 2007: 241-255 - Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal:
Tradeoffs in the Complexity of Backdoor Detection. CP 2007: 256-270 - Grégoire Dooms, Pascal Van Hentenryck, Laurent Michel:
Model-Driven Visualizations of Constraint-Based Local Search. CP 2007: 271-285 - Antoine Gargani, Philippe Refalo:
An Efficient Model and Strategy for the Steel Mill Slab Design Problem. CP 2007: 77-89 - Marco Gavanelli:
The Log-Support Encoding of CSP into SAT. CP 2007: 815-822 - Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Dealing with Incomplete Preferences in Soft Constraint Problems. CP 2007: 286-300 - Rosella Gennari, Ornella Mich:
Constraint-Based Temporal Reasoning for E-Learning with LODE. CP 2007: 90-104 - Ian P. Gent, Tom Kelsey, Stephen A. Linton, J. Pearson, Colva M. Roney-Dougal:
Groupoids and Conditional Symmetry. CP 2007: 823-830 - Alfonso Gerevini, Alessandro Saetti:
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure. CP 2007: 301-316
skipping 38 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-06-01 06:01 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