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
- 2013
- Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints. CP 2013: 80-96 - Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Peter J. Stuckey:
To Encode or to Propagate? The Best Choice for Each Constraint in SAT. CP 2013: 97-106 - Ozgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale:
Automated Symmetry Breaking and Model Selection in Conjure. CP 2013: 107-116 - Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy:
Improving WPM2 for (Weighted) Partial MaxSAT. CP 2013: 117-132 - Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu:
MinSAT versus MaxSAT for Optimization Problems. CP 2013: 133-142 - Amine Balafrej, Christian Bessiere, Remi Coletta, El-Houssine Bouyakhf:
Adaptive Parameterized Consistency. CP 2013: 143-158 - Nicolas Beldiceanu, Georgiana Ifrim, Arnaud Lenoir, Helmut Simonis:
Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker. CP 2013: 733-748 - Christian Bessiere, Hélène Fargier, Christophe Lecoutre:
Global Inverse Consistency for Interactive Constraint Satisfaction. CP 2013: 159-174 - Simon Brockbank, Gilles Pesant, Louis-Martin Rousseau:
Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems. CP 2013: 175-183 - Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search. CP 2013: 749-757 - Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven:
On the Reduction of the CSP Dichotomy Conjecture to Digraphs. CP 2013: 184-199 - Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres. CP 2013: 47-62 - Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable Approximate Model Counter. CP 2013: 200-216 - Geoffrey Chu, Peter J. Stuckey:
Dominance Driven Search. CP 2013: 217-229 - David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný:
Tractable Combinations of Global Constraints. CP 2013: 230-246 - Jessica Davies, Fahiem Bacchus:
Postponing Optimization to Speed Up MAXSAT Solving. CP 2013: 247-262 - Erin Delisle, Fahiem Bacchus:
Solving Weighted CSPs by Successive Relaxations. CP 2013: 273-281 - Gregory J. Duck, Joxan Jaffar, Nicolas C. H. Koh:
Constraint-Based Program Reasoning with Heaps and Separation. CP 2013: 282-298 - Jean-Guillaume Fages, Tanguy Lapègue:
Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem. CP 2013: 63-79 - Daniel Fontaine, Laurent Michel, Pascal Van Hentenryck:
Model Combinators for Hybrid Optimization. CP 2013: 299-314 - Kathryn Francis, Jorge A. Navas, Peter J. Stuckey:
Modelling Destructive Assignments. CP 2013: 315-330 - Alex Fukunaga:
An Improved Search Algorithm for Min-Perturbation. CP 2013: 331-339 - Graeme Gange, Peter J. Stuckey, Pascal Van Hentenryck:
Explaining Propagators for Edge-Valued Decision Diagrams. CP 2013: 340-355 - Luca Di Gaspero, Andrea Rendl, Tommaso Urli:
Constraint-Based Approaches for Balancing Bike Sharing Systems. CP 2013: 758-773 - Allen Van Gelder:
Primal and Dual Encoding from Applications into Quantified Boolean Formulas. CP 2013: 694-707 - Simon de Givry, Steven D. Prestwich, Barry O'Sullivan:
Dead-End Elimination for Weighted CSP. CP 2013: 263-272 - Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann:
Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems. CP 2013: 774-789 - Stefano Gualandi, Michele Lombardi:
A Simple and Effective Decomposition for the Multidimensional Binpacking Constraint. CP 2013: 356-364 - Patricia Gutierrez, Jimmy Ho-Man Lee, Ka Man Lei, Terrence W. K. Mak, Pedro Meseguer:
Maintaining Soft Arc Consistencies in BnB-ADOPT + during Search. CP 2013: 365-380 - Djamal Habet, Donia Toumi:
Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers. CP 2013: 678-693
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-12-14 09:53 CET 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