![](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 51 matches
- 2010
- Andreas Bauer, Viorica Botea, Mark Brown, Matt Gray, Daniel Harabor, John K. Slaney:
An Integrated Modelling, Debugging, and Visualisation Environment for G12. CP 2010: 522-536 - Kiyan Ahmadizadeh, Bistra Dilkina
, Carla P. Gomes, Ashish Sabharwal:
An Empirical Study of Optimization for Maximizing Diffusion in Networks. CP 2010: 514-521 - David Allouche, Simon de Givry, Thomas Schiex:
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP. CP 2010: 53-60 - Ignacio Araya
, Gilles Trombettoni, Bertrand Neveu:
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity. CP 2010: 61-68 - Sigal Asaf, Haggai Eran
, Yossi Richter, Daniel P. Connors, Donna L. Gresh, Julio Ortega, Michael J. Mcinnis:
Applying Constraint Programming to Identification and Assignment of Service Professionals. CP 2010: 24-37 - Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
Improving the Performance of maxRPC. CP 2010: 69-83 - J. Christopher Beck:
Checking-Up on Branch-and-Check. CP 2010: 84-98 - Russell Bent
, Pascal Van Hentenryck:
Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows. CP 2010: 99-113 - Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper
, Toby Walsh:
Decomposition of the NValue Constraint. CP 2010: 114-128 - Karl Sundequist Blomdahl, Pierre Flener
, Justin Pearson:
Contingency Plans for Air Traffic Management. CP 2010: 643-657 - Hadrien Cambazard, Barry O'Sullivan
:
Propagating the Bin Packing Constraint Using Linear Programming. CP 2010: 129-136 - Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Database Constraints and Homomorphism Dualities. CP 2010: 475-490 - Gilles Chabert, Nicolas Beldiceanu:
Sweeping with Continuous Domains. CP 2010: 137-151 - Martin C. Cooper
, Stanislav Zivný:
A New Hybrid Tractable Class of Soft Constraint Problems. CP 2010: 152-166 - Jessica Davies, Jeremy Cho, Fahiem Bacchus:
Using Learnt Clauses in maxsat. CP 2010: 176-190 - Yves Deville, Pascal Van Hentenryck:
Domain Consistency with Forbidden Values. CP 2010: 191-205 - Stefano Ermon, Carla P. Gomes, Bart Selman:
Computing the Density of States of Boolean Formulas. CP 2010: 38-52 - Ian P. Gent
, Christopher Jefferson
, Ian Miguel
, Peter Nightingale:
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints. CP 2010: 206-220 - Alexandre Goldsztejn
, Olivier Mullier, Damien Eveillard
, Hiroshi Hosobe:
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework. CP 2010: 221-235 - Gianluigi Greco, Francesco Scarcello
:
Structural Tractability of Enumerating CSP Solutions. CP 2010: 236-251 - Long Guo, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Diversification and Intensification in Parallel SAT Solving. CP 2010: 252-265 - Samid Hoda, Willem Jan van Hoeve, John N. Hooker:
A Systematic Approach to MDD-Based Constraint Programming. CP 2010: 266-280 - Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann:
A Complete Multi-valued SAT Solver. CP 2010: 281-296 - Tommi A. Junttila, Petteri Kaski:
Exact Cover via Satisfiability: An Empirical Study. CP 2010: 297-304 - Ahmet Serkan Karatas, Halit Oguztüzün
, Ali H. Dogru:
Global Constraints on Feature Models. CP 2010: 537-551 - George Katsirelos, Nina Narodytska, Toby Walsh:
On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry. CP 2010: 305-320 - Mehdi Khiari, Patrice Boizumault, Bruno Crémilleux:
Constraint Programming for Mining n-ary Patterns. CP 2010: 552-567 - Lars Kotthoff
, Ian Miguel
, Peter Nightingale:
Ensemble Classification for Constraint Solver Configuration. CP 2010: 321-329 - Roman van der Krogt, Jacob Feldman, James Little, David Stynes:
An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management. CP 2010: 568-582 - Nadjib Lazaar
, Arnaud Gotlieb, Yahia Lebbah
:
On Testing Constraint Programs. CP 2010: 330-344
skipping 21 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-07-02 20:10 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