default search action
22nd CP 2016: Toulouse, France
- Michel Rueher:
Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. Lecture Notes in Computer Science 9892, Springer 2016, ISBN 978-3-319-44952-4
Technical Track
- Özgür Akgün
, Ian P. Gent, Christopher Jefferson
Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT. 3-12 - Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints. 13-29 - Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
An Adaptive Parallel SAT Solver. 30-48 - Gleb Belov
Improved Linearization of Constraint Programming Models. 49-65 - Jeremias Berg
Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving. 66-85 - David Bergman, André Augusto Ciré:
Multiobjective Optimization by Decision Diagrams. 86-95 - Olaf Beyersdorff
Dependency Schemes in QBF Calculi: Semantics and Soundness. 96-112 - Alessio Bonfietti, Alessandro Zanarini, Michele Lombardi, Michela Milano:
The Multirate Resource Constraint. 113-129 - Clément Carbonnel
The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable. 130-146 - Clément Carbonnel
Propagation via Kernelization: The Vertex Cover Constraint. 147-156 - Michael Codish
Breaking Symmetries in Graphs: The Nauty Way. 157-172 - Martin C. Cooper
Extending Broken Triangles and Enhanced Value-Merging. 173-188 - Diego de Uña, Graeme Gange
A Bounded Path Propagator on Directed Graphs. 189-206 - Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus:
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. 207-223 - Thibaut Feydy, Peter J. Stuckey:
Interval Constraints with Learning: Application to Air Traffic Control. 224-232 - Robert Ganian, M. S. Ramanujan, Stefan Szeider
Backdoors to Tractable Valued CSP. 233-250 - Jack Goffinet
Monte-Carlo Tree Search for the Maximum Satisfiability Problem. 251-267 - Luke Hunsberger, Roberto Posenato
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks. 268-286 - Alexey Ignatiev
On Finding Minimum Satisfying Assignments. 287-297 - Philippe Jégou, Hanan Kanso, Cyril Terrioux:
Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. 298-315 - Wen-Yang Ku, J. Christopher Beck:
Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems. 316-332 - Nadjib Lazaar
A Global Constraint for Closed Frequent Pattern Mining. 333-349 - Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon:
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. 350-368 - Harsha Nagarajan
Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning. 369-387 - Anthony Palmieri, Jean-Charles Régin, Pierre Schaus:
Parallel Strategies Selection. 388-404 - Émilie Picard-Cantin, Mathieu Bouchard, Claude-Guy Quimper
Learning Parameters for the Sequence Constraint from Solutions. 405-420 - Timon Hertli, Isabelle Hurbain, Sebastian Millius, Robin A. Moser, Dominik Scheder
The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors. 421-437 - Andreas Schutt
Explaining Producer/Consumer Constraints. 438-454 - Maxim Shishmarev, Christopher Mears, Guido Tack, Maria Garcia de la Banda
Learning from Learning Solvers. 455-472 - Xujie Si, Xin Zhang
On Incremental Core-Guided MaxSAT Solving. 473-482 - Ria Szeredi, Andreas Schutt
Modelling and Solving Multi-mode Resource-Constrained Project Scheduling. 483-492 - Alexander Tesch:
A Nearly Exact Propagation Algorithm for Energetic Reasoning in \mathcal O(n^2 \log n). 493-519 - Sascha Van Cauwelaert, Cyrille Dejemeppe, Jean-Noël Monette, Pierre Schaus:
Efficient Filtering for the Unary Resource with Family-Based Transition Times. 520-535
Application Track
- Kyle E. C. Booth, Goldie Nejat, J. Christopher Beck:
A Constraint Programming Approach to Multi-Robot Task Allocation and Scheduling in Retirement Homes. 539-555 - Stefano Di Alesio:
Optimal Performance Tuning in Real-Time Systems Using Multi-objective Constrained Optimization. 556-574 - Robinson Duque
SABIO: An Implementation of MIP and CP for Interactive Soccer Queries. 575-583 - David Gérault, Marine Minier, Christine Solnon:
Constraint Programming Models for Chosen Key Differential Cryptanalysis. 584-601 - Katherine Giles, Willem-Jan van Hoeve:
Solving a Supply-Delivery Scheduling Problem with Constraint Programming. 602-617 - Vincent Goulet, Wei Li, Hyunmin Cheong, Francesco Iorio, Claude-Guy Quimper
Four-Bar Linkage Synthesis Using Non-convex Optimization. 618-635 - Xavier Lorca
Using Constraint Programming for the Urban Transit Crew Rescheduling Problem. 636-649 - Feifei Ma, Xin Gao, Minghao Yin
Optimizing Shortwave Radio Broadcast Resource Allocation via Pseudo-Boolean Constraint Solving and Local Search. 650-665 - Samir Sebbah, Claire Bagley, Mike Colena, Serdar Kadioglu:
Availability Optimization in Cloud-Based In-Memory Data Grids. 666-679
Computational Sustainability Track
- BoonPing Lim, Hassan L. Hijazi
Online HVAC-Aware Occupancy Scheduling with Adaptive Temperature Control. 683-700 - Yexiang Xue, Ian Davies, Daniel Fink, Christopher Wood, Carla P. Gomes:
Behavior Identification in Two-Stage Games for Incentivizing Citizen Science Exploration. 701-717
CP and Biology Track
- Ludwig Krippahl
Constraining Redundancy to Improve Protein Docking. 721-732 - Clément Viricel, David Simoncini, Sophie Barbe
Guaranteed Weighted Counting for Affinity Computation: Beyond Determinism and Structure. 733-750
Music Track
- John N. Hooker:
Finding Alternative Musical Scales. 753-768 - Alexandre Papadopoulos, Pierre Roy, François Pachet:
Assisted Lead Sheet Composition Using FlowComposer. 769-785 - Pierre Roy, Guillaume Perez, Jean-Charles Régin, Alexandre Papadopoulos, François Pachet, Marco Marchini:
Enforcing Structure on Temporal Sequences: The Allen Constraint. 786-801 - Tsubasa Tanaka, Brian Bemman, David Meredith
Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-Partition Arrays. 802-810
Preference, Social Choice and Optimization Track
- Ferdinando Fioretto
A Dynamic Programming-Based MCMC Framework for Solving DCOPs with GPUs. 813-831 - Ciaran McCreesh, Patrick Prosser, James Trimble:
Morphing Between Stable Matching Problems. 832-840
Testing and Verification Track
- Merav Aharoni, Yael Ben-Haim, Shai Doron, Anatoly Koyfman, Elena Tsanko, Michael Veksler:
Using Graph-Based CSP to Solve the Address Translation Problem. 843-858 - Xiaojun Sun, Irina Ilioaea, Priyank Kalla, Florian Enescu:
Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm. 859-875
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.
last updated on 2024-10-02 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: