Остановите войну!
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 61 matches
- 2021
- Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles. CP 2021: 11:1-11:17 - Carlos Ansótegui, Jesus Ojeda, Eduard Torres:
Building High Strength Mixed Covering Arrays with Constraints. CP 2021: 12:1-12:17 - Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, Alain Nguyen:
Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem. CP 2021: 14:1-14:16 - Valentin Antuori, Tom Portoleau, Louis Rivière, Emmanuel Hebrard:
On How Turing and Singleton Arc Consistency Broke the Enigma Code. CP 2021: 13:1-13:16 - João Araújo, Choiwah Chow, Mikolás Janota:
Filtering Isomorphic Models by Invariants (Short Paper). CP 2021: 4:1-4:9 - Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, M. Grazia Speranza:
The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk). CP 2021: 1:1-1:1 - Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani:
Practical Bigraphs via Subgraph Isomorphism. CP 2021: 15:1-15:17 - Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis:
The Hybrid Flexible Flowshop with Transportation Times. CP 2021: 16:1-16:18 - Yiwei Bai, Di Chen, Carla P. Gomes:
CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games. CP 2021: 17:1-17:14 - Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, Stéphane Le Ménec:
An Interval Constraint Programming Approach for Quasi Capture Tube Validation. CP 2021: 18:1-18:17 - Shaowei Cai, Chuan Luo, Xindi Zhang, Jian Zhang:
Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper). CP 2021: 5:1-5:10 - Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. CP 2021: 19:1-19:18 - Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux:
Combining VSIDS and CHB Using Restarts in SAT. CP 2021: 20:1-20:19 - Martin C. Cooper, João Marques-Silva:
On the Tractability of Explaining Decisions of Classifiers. CP 2021: 21:1-21:18 - Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada:
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP 2021: 22:1-22:19 - Tomás Dlask, Tomás Werner, Simon de Givry:
Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations. CP 2021: 23:1-23:18 - Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab:
Complications for Computational Experiments from Modern Processors. CP 2021: 25:1-25:21 - Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. CP 2021: 24:1-24:20 - Ferdinando Fioretto:
Constrained-Based Differential Privacy (Invited Talk). CP 2021: 2:1-2:1 - Cristian Galleguillos, Zeynep Kiziltan, Ricardo Soto:
A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications. CP 2021: 26:1-26:16 - Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon:
The Dungeon Variations Problem Using Constraint Programming. CP 2021: 27:1-27:16 - Hannes Ihalainen, Jeremias Berg, Matti Järvisalo:
Refined Core Relaxation for Core-Guided MaxSAT Solving. CP 2021: 28:1-28:19 - Markus Iser, Tomás Balyo:
Unit Propagation with Stable Watches (Short Paper). CP 2021: 6:1-6:8 - Nicolas Isoart, Jean-Charles Régin:
A Linear Time Algorithm for the k-Cutset Constraint. CP 2021: 29:1-29:16 - Nicolas Isoart, Jean-Charles Régin:
A k-Opt Based Constraint for the TSP. CP 2021: 30:1-30:16 - Mikolás Janota, António Morgado, José Fragoso Santos, Vasco M. Manquinho:
The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets. CP 2021: 31:1-31:16 - Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP 2021: 32:1-32:20 - Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent:
Learning TSP Requires Rethinking Generalization. CP 2021: 33:1-33:21 - Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper). CP 2021: 7:1-7:11 - Markus Kirchweger, Stefan Szeider:
SAT Modulo Symmetries for Graph Generation. CP 2021: 34:1-34:16
skipping 31 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-30 20:58 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