Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th CP 2012: Québec City, QC, Canada
- Michela Milano:
Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings. Lecture Notes in Computer Science 7514, Springer 2012, ISBN 978-3-642-33557-0
Invited Papers
- Laurent D. Michel:
Constraint Programming and a Usability Quest. 1 - Miguel F. Anjos
:
Optimization Challenges in Smart Grid Operations. 2-3 - Barry O'Sullivan:
Where Are the Interesting Problems? 4-5
Best Paper
- Geoffrey Chu, Peter J. Stuckey:
A Generic Method for Identifying and Exploiting Dominance Relations. 6-22
Best Application Paper
- Gilles Simonin, Christian Artigues, Emmanuel Hebrard, Pierre Lopez:
Scheduling Scientific Experiments on the Rosetta/Philae Mission. 23-37
Honorable Mentions
- Hannes Uppman:
Max-Sur-CSP on Two Elements. 38-54 - Mohamed Siala, Emmanuel Hebrard, Marie-José Huguet:
An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality. 55-69
CP Main Track
- Ignasi Abío, Peter J. Stuckey:
Conflict Directed Lazy Decomposition. 70-85 - Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy:
Improving SAT-Based Weighted MaxSAT Solvers. 86-101 - Vincent Armant, Laurent Simon, Philippe Dague:
Distributed Tree Decomposition with Privacy. 102-117 - Gilles Audemard, Laurent Simon:
Refining Restarts Strategies for SAT and UNSAT. 118-126 - Mohammed Saïd Belaid, Claude Michel, Michel Rueher:
Boosting Local Consistency Algorithms over Floating-Point Numbers. 127-140 - Nicolas Beldiceanu, Helmut Simonis:
A Model Seeker: Extracting Global Constraint Models from Positive Examples. 141-157 - Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva:
On Computing Minimal Equivalent Subformulas. 158-174 - Christian Bessiere, Patricia Gutierrez, Pedro Meseguer:
Including Soft Global Constraints in DCOPs. 175-190 - Alessio Bonfietti, Michele Lombardi:
The Weighted Average Constraint. 191-206 - Ignacio Castiñeiras, Milan De Cauwer, Barry O'Sullivan:
Weibull-Based Benchmarks for Bin Packing. 207-222 - Kenil C. K. Cheng, Wei Xia, Roland H. C. Yap:
Space-Time Tradeoffs for the Regular Constraint. 223-237 - Geoffrey Chu, Peter J. Stuckey:
Inter-instance Nogood Learning in Constraint Programming. 238-247 - Alessandro Cimatti, Andrea Micheli, Marco Roveri:
Solving Temporal Problems Using SMT: Strong Controllability. 248-264 - Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. 265-273 - Kathryn Francis, Sebastian Brand, Peter J. Stuckey:
Optimisation Modelling for Software Developers. 274-289 - Laurent Granvilliers:
Adaptive Bisection of Numerical CSPs. 290-298 - Stefano Gualandi, Federico Malucelli:
Resource Constrained Shortest Paths with a Super Additive Objective Function. 299-315 - Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivný:
Relating Proof Complexity Measures and Practical Hardness of SAT. 316-331 - George Katsirelos, Nina Narodytska, Toby Walsh:
The SeqBin Constraint Revisited. 332-347 - George Katsirelos, Laurent Simon:
Eigenvector Centrality in Industrial SAT Instances. 348-356 - Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Classifying and Propagating Parity Constraints. 357-372 - Arnaud Lallouet, Jimmy Ho-Man Lee, Terrence W. K. Mak:
Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle. 373-389 - Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary:
Propagating Soft Table Constraints. 390-405 - Christophe Lecoutre, Olivier Roussel, Djamel E. Dehani:
WCSP Integration of Soft Neighborhood Substitutability. 406-421 - Jimmy Ho-Man Lee, Jingying Li:
Increasing Symmetry Breaking by Preserving Target Symmetries. 422-438 - Arnaud Letort, Nicolas Beldiceanu, Mats Carlsson:
A Scalable Sweep Algorithm for the cumulative Constraint. 439-454 - Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich:
A New Encoding from MinSAT into MaxSAT. 455-463 - Weiming Liu, Sanjiang Li:
Solving Minimal Constraint Networks in Qualitative Spatial and Temporal Reasoning. 464-479 - Florent R. Madelaine, Barnaby Martin:
Containment, Equivalence and Coreness from CSP to QCSP and Beyond. 480-495 - Jean-Baptiste Mairy, Pascal Van Hentenryck, Yves Deville:
An Optimal Filtering Algorithm for Table Constraints. 496-511 - Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Parallel SAT Solver Selection and Scheduling. 512-526 - Laurent D. Michel, Pascal Van Hentenryck:
Constraint Satisfaction over Bit-Vectors. 527-543 - Jean-Noël Monette, Pierre Flener, Justin Pearson:
Towards Solver-Independent Propagators. 544-560 - Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo:
Interactive Algorithm for Multi-Objective Constraint Optimization. 561-576 - Thierry Petit:
Focus : A Constraint for Concentrating High Costs. 577-592 - Olivier Ponsini, Claude Michel, Michel Rueher:
Refining Abstract Interpretation Based Value Analysis with Constraint Programming Techniques. 593-607 - Cédric Pralet, Gérard Verfaillie:
Time-Dependent Simple Temporal Networks. 608-623 - Emma Rollon, Javier Larrosa:
Improved Bounded Max-Sum for Distributed Constraint Optimization. 624-632 - Domenico Salvagnin, Toby Walsh:
A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling. 633-646 - Allen Van Gelder:
Contributions to the Theory of Practical Quantified Boolean Formula Solving. 647-663 - Philippe Vismara, Remi Coletta:
Breaking Variable Symmetry in Almost Injective Problems. 664-671 - Siert Wieringa:
Understanding, Improving and Parallelizing MUS Finding Using Model Rotation. 672-687 - Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere:
Revisiting Neighborhood Inverse Consistency on Binary CSPs. 688-703 - Michal Wrona:
Syntactically Characterizing Local-to-Global Consistency in ORD-Horn. 704-719 - Xi Yun, Susan L. Epstein:
A Hybrid Paradigm for Adaptive Parallel Search. 720-734
Application Track
- Hadrien Cambazard, Bernard Penz:
A Constraint Programming Approach for the Traveling Purchaser Problem. 735-749 - Roberto Castañeda Lozano, Mats Carlsson, Frej Drejhammar, Christian Schulte:
Constraint-Based Register Allocation and Instruction Scheduling. 750-766 - Hanyu Gu, Peter J. Stuckey, Mark G. Wallace:
Maximising the Net Present Value of Large Resource-Constrained Projects. 767-781 - Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Comparing Solution Methods for the Machine Reassignment Problem. 782-797 - Faten Nabli, François Fages, Thierry Martinez, Sylvain Soliman:
A Boolean Model for Enumerating Minimal Siphons and Traps in Petri Nets. 798-814 - Pierre Schaus, Jean-Charles Régin, Rowan Van Schaeren, Wout Dullaert, Birger Raa:
Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem. 815-822 - Thiago Serra, Gilberto Nishioka, Fernando J. M. Marcellino:
The Offshore Resources Scheduling Problem: Detailing a Constraint Programming Approach. 823-839
Multi-disciplinary Track
- 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. 840-849 - Federico Campeotto, Alessandro Dal Palù, Agostino Dovier, Ferdinando Fioretto, Enrico Pontelli:
A Filtering Technique for Fragment Assembly- Based Proteins Loop Modeling with Constraints. 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. 867-882 - Andreas Distler, Christopher Jefferson, Tom Kelsey, Lars Kotthoff:
The Semigroups of Order 10. 883-899 - Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters:
Exploring Chemistry Using SMT. 900-915 - Pascal Germain, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza, François Laviolette, Claude-Guy Quimper:
A Pseudo-Boolean Set Covering Machine. 916-924 - Alon Grubshtein, Amnon Meisels:
Finding a Nash Equilibrium by Asynchronous Backtracking. 925-940 - João Guerra, Inês Lynce:
Reasoning over Biological Networks Using Maximum Satisfiability. 941-956 - Georgiana Ifrim, Barry O'Sullivan, Helmut Simonis:
Properties of Energy-Price Forecasts for Scheduling. 957-972 - Jérôme Lang, Jérôme Mengin, Lirong Xia:
Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains. 973-987 - Michael Morin, Anika-Pascale Papillon, Irène Abi-Zeid, François Laviolette, Claude-Guy Quimper:
Constraint Programming for Path Planning with Uncertainty - Solving the Optimal Search Path Problem. 988-1003 - Santiago Ontañón, Pedro Meseguer:
Feature Term Subsumption Using Constraint Programming with Basic Variable Symmetry. 1004-1012
a service of 
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-05-10 18:45 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:
