Остановите войну!
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 72 matches
- 2012
- Ignasi Abío, Peter J. Stuckey:
Conflict Directed Lazy Decomposition. CP 2012: 70-85 - David Allouche, Seydou Traoré, Isabelle André, Simon de Givry, George Katsirelos, Sophie Barbe, Thomas Schiex:
Computational Protein Design as a Cost Function Network Optimization Problem. CP 2012: 840-849 - Miguel F. Anjos:
Optimization Challenges in Smart Grid Operations. CP 2012: 2-3 - Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy:
Improving SAT-Based Weighted MaxSAT Solvers. CP 2012: 86-101 - Vincent Armant, Laurent Simon, Philippe Dague:
Distributed Tree Decomposition with Privacy. CP 2012: 102-117 - Gilles Audemard, Laurent Simon:
Refining Restarts Strategies for SAT and UNSAT. CP 2012: 118-126 - Mohammed Saïd Belaid, Claude Michel, Michel Rueher:
Boosting Local Consistency Algorithms over Floating-Point Numbers. CP 2012: 127-140 - Nicolas Beldiceanu, Helmut Simonis:
A Model Seeker: Extracting Global Constraint Models from Positive Examples. CP 2012: 141-157 - Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva:
On Computing Minimal Equivalent Subformulas. CP 2012: 158-174 - Christian Bessiere, Patricia Gutierrez, Pedro Meseguer:
Including Soft Global Constraints in DCOPs. CP 2012: 175-190 - Alessio Bonfietti, Michele Lombardi:
The Weighted Average Constraint. CP 2012: 191-206 - Hadrien Cambazard, Bernard Penz:
A Constraint Programming Approach for the Traveling Purchaser Problem. CP 2012: 735-749 - Federico Campeotto, Alessandro Dal Palù, Agostino Dovier, Ferdinando Fioretto, Enrico Pontelli:
A Filtering Technique for Fragment Assembly- Based Proteins Loop Modeling with Constraints. CP 2012: 850-866 - Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann:
A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots. CP 2012: 867-882 - Ignacio Castiñeiras, Milan De Cauwer, Barry O'Sullivan:
Weibull-Based Benchmarks for Bin Packing. CP 2012: 207-222 - Kenil C. K. Cheng, Wei Xia, Roland H. C. Yap:
Space-Time Tradeoffs for the Regular Constraint. CP 2012: 223-237 - Geoffrey Chu, Peter J. Stuckey:
A Generic Method for Identifying and Exploiting Dominance Relations. CP 2012: 6-22 - Geoffrey Chu, Peter J. Stuckey:
Inter-instance Nogood Learning in Constraint Programming. CP 2012: 238-247 - Alessandro Cimatti, Andrea Micheli, Marco Roveri:
Solving Temporal Problems Using SMT: Strong Controllability. CP 2012: 248-264 - Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. CP 2012: 265-273 - Andreas Distler, Christopher Jefferson, Tom Kelsey, Lars Kotthoff:
The Semigroups of Order 10. CP 2012: 883-899 - Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters:
Exploring Chemistry Using SMT. CP 2012: 900-915 - Kathryn Francis, Sebastian Brand, Peter J. Stuckey:
Optimisation Modelling for Software Developers. CP 2012: 274-289 - Allen Van Gelder:
Contributions to the Theory of Practical Quantified Boolean Formula Solving. CP 2012: 647-663 - Pascal Germain, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza, François Laviolette, Claude-Guy Quimper:
A Pseudo-Boolean Set Covering Machine. CP 2012: 916-924 - Laurent Granvilliers:
Adaptive Bisection of Numerical CSPs. CP 2012: 290-298 - Alon Grubshtein, Amnon Meisels:
Finding a Nash Equilibrium by Asynchronous Backtracking. CP 2012: 925-940 - Hanyu Gu, Peter J. Stuckey, Mark G. Wallace:
Maximising the Net Present Value of Large Resource-Constrained Projects. CP 2012: 767-781 - Stefano Gualandi, Federico Malucelli:
Resource Constrained Shortest Paths with a Super Additive Objective Function. CP 2012: 299-315 - João Guerra, Inês Lynce:
Reasoning over Biological Networks Using Maximum Satisfiability. CP 2012: 941-956
skipping 42 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-05-28 17:18 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