Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th CP 2014: Lyon, France
- Barry O'Sullivan:
Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings. Lecture Notes in Computer Science 8656, Springer 2014, ISBN 978-3-319-10427-0
Invited Talks
- Maria Fox
:
A Modular Architecture for Hybrid Planning with Theories. 1-2 - Patrick Prosser:
Teaching Constraint Programming. 3 - Louis-Martin Rousseau:
One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling. 4-5 - Vijay A. Saraswat:
Concurrent Constraint Programming Research Programmes - Redux. 6-8
Best Technical Track Paper
- Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. 9-24
Best Application Track Paper
- Morten Mossige, Arnaud Gotlieb, Hein Meling:
Using CP in Automatic Test Generation for ABB Robotics' Paint Control System. 25-41
Best Student Paper
- Umut Oztok, Adnan Darwiche:
On Compiling CNF into Decision-DNNF. 42-57
Runner-Up Best Student Paper
- Thi-Van-Anh Nguyen, Arnaud Lallouet:
A Complete Solver for Constraint Games. 58-74
Technical Track
- Ignasi Abío, Peter J. Stuckey:
Encoding Linear Constraints into SAT. 75-91 - André Abramé, Djamal Habet:
Efficient Application of Max-SAT Resolution on Inconsistent Subsets. 92-107 - Roberto Amadini, Peter J. Stuckey:
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers. 108-124 - Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel:
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. 125-141 - Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson:
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators. 142-157 - Christoph Berkholz:
The Propagation Depth of Local Consistency. 158-173 - Christian Bessiere, Emmanuel Hebrard, George Katsirelos, Zeynep Kiziltan, Émilie Picard-Cantin, Claude-Guy Quimper, Toby Walsh:
The Balance Constraint Family. 174-189 - Loïc Blet, Samba Ndojh Ndiaye, Christine Solnon:
Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector. 190-206 - Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving Intensional Weighted CSPs by Incremental Optimization with BDDs. 207-223 - Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
On Backdoors to Tractable Constraint Languages. 224-239 - Geoffrey Chu, Peter J. Stuckey:
Nested Constraint Programs. 240-255 - Martin C. Cooper:
Beyond Consistency and Substitutability. 256-271 - Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Subexponential Time Complexity of CSP with Global Constraints. 272-288 - Alban Derrien, Thierry Petit:
A New Characterization of Relevant Intervals for Energetic Reasoning. 289-297 - Alban Derrien, Thierry Petit, Stéphane Zampelli:
A Declarative Paradigm for Robust Cumulative Scheduling. 298-306 - Ferdinando Fioretto, Tiep Le, William Yeoh, Enrico Pontelli, Tran Cao Son:
Improving DPOP with Branch Consistency for Solving Distributed Constraint Optimization Problems. 307-323 - Daniel Fontaine, Laurent D. Michel, Pascal Van Hentenryck:
Constraint-Based Lagrangian Relaxation. 324-339 - Kathryn Francis, Peter J. Stuckey:
Loop Untangling. 340-355 - Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Glenna F. Nightingale, Peter Nightingale:
Discriminating Instance Generation for Automated Constraint Model Selection. 356-365 - Umberto Grandi, Hang Luo, Nicolas Maudet, Francesca Rossi:
Aggregating CP-nets with Unfeasible Outcomes. 366-381 - Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey, Yves Deville:
The StockingCost Constraint. 382-397 - Daisuke Ishii, Kazuki Yoshizoe, Toyotaro Suzumura:
Scalable Parallel Numerical CSP Solver. 398-406 - Philippe Jégou, Cyril Terrioux:
Tree-Decompositions with Connected Clusters for Solving Constraint Networks. 407-423 - Wen-Yang Ku, Thiago Pinheiro, J. Christopher Beck:
CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem. 424-439 - Ronan Le Bras, Carla P. Gomes, Bart Selman:
On the Erdős Discrepancy Problem. 440-448 - Jasper C. H. Lee, Jimmy H. M. Lee:
Towards Practical Infinite Stream Constraint Programming: Applications and Implementation. 449-464 - Jimmy H. M. Lee, Zichen Zhu:
An Increasing-Nogoods Global Constraint for Symmetry Breaking During Search. 465-480 - Levi H. S. Lelis, Lars Otten, Rina Dechter:
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. 481-496 - Chavalit Likitvivatanavong, Wei Xia, Roland H. C. Yap:
Higher-Order Consistencies through GAC on Factor Variables. 497-513 - Florian Lonsing, Uwe Egly:
Incremental QBF Solving. 514-530 - Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. 531-548 - Ciaran McCreesh, Patrick Prosser:
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. 549-563 - António Morgado, Carmine Dodaro, João Marques-Silva:
Core-Guided MaxSAT with Soft Cardinality Constraints. 564-573 - Robert Nieuwenhuis:
The IntSat Method for Integer Linear Programming. 574-589 - Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel:
Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination. 590-605 - Guillaume Perez, Jean-Charles Régin:
Improving GAC-4 for Table and MDD Constraints. 606-621 - Jean-Charles Régin, Mohamed Rezgui, Arnaud Malapert:
Improvement of the Embarrassingly Parallel Search for Data Centers. 622-635 - Andrea Rendl, Guido Tack, Peter J. Stuckey:
Stochastic MiniZinc. 636-645 - Emma Rollon, Javier Larrosa:
Decomposing Utility Functions in Bounded Max-Sum for Distributed Constraint Optimization. 646-654 - Ashish Sabharwal, Horst Samulowitz:
Insights into Parallelism with Intensive Knowledge Sharing. 655-671 - Ignacio Salas, Gilles Chabert, Alexandre Goldsztejn:
The Non-overlapping Constraint between Objects Described by Non-linear Inequalities. 672-687 - Anthony Schneider, Robert J. Woodward, Berthe Y. Choueiry, Christian Bessiere:
Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning. 688-704 - Pascal Van Hentenryck, Laurent D. Michel:
Domain Views for Constraint Programming. 705-720 - Mohamed Wahbi, Kenneth N. Brown:
Global Constraints in Distributed CSP: Concurrent GAC and Explanations in ABT. 721-737 - Mohamed Wahbi, Kenneth N. Brown:
The Impact of Wireless Communication on Distributed Constraint Satisfaction. 738-754 - Robert J. Woodward, Anthony Schneider, Berthe Y. Choueiry, Christian Bessiere:
Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports. 755-764
Application Track
- Andrea Bartolini, Andrea Borghesi, Thomas Bridi, Michele Lombardi, Michela Milano:
Proactive Workload Dispatching on the EURORA Supercomputer. 765-780 - Miquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahí, Josep Suy, Mateu Villaret:
Scheduling B2B Meetings. 781-796 - Simon de Givry, Jimmy Ho-Man Lee, Ka Lun Leung, Yu Wai Shum:
Solving a Judge Assignment Problem Using Conjunctions of Global Cost Functions. 797-812 - Stefano Di Alesio, Shiva Nejati, Lionel C. Briand, Arnaud Gotlieb:
Worst-Case Scheduling of Software Tasks - A Constraint Optimization Model to Support Performance Testing. 813-830 - Steven Gay, Pierre Schaus, Vivian De Smedt:
Continuous Casting Scheduling with Constraint Programming. 831-845 - Shuo Li, Ahmed Hemani:
Case Study: Constraint Programming in a System Level Synthesis Framework. 846-861 - Marie Pelleau, Louis-Martin Rousseau, Pierre L'Ecuyer, Walid Zegal, Louis Delorme:
Scheduling Agents Using Forecast Call Arrivals at Hydro-Québec's Call Centers. 862-869 - Cédric Pralet, Charles Lesire:
Deployment of Mobile Wireless Sensor Networks for Crisis Management: A Constraint-Based Local Search Approach. 870-885 - Mirko Stojadinovic:
Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems. 886-902 - David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Optimization Bounds from Binary Decision Diagrams - (Extended Abstract). 903-907 - Miquel Bofill, Dídac Busquets, Mateu Villaret:
Reformulation Based MaxSAT Robustness - (Extended Abstract). 908-912 - Elsa Carvalho, Jorge Cruz, Pedro Barahona:
Probabilistic Constraints for Nonlinear Inverse Problems - (Extended Abstract). 913-917 - André A. Ciré, Willem-Jan van Hoeve:
Multivalued Decision Diagrams for Sequencing Problems - (Extended Abstract). 918-922 - Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract). 923-927 - Martin C. Cooper, Frederic Maris, Pierre Régnier:
Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract). 928-932 - Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). 933-937 - Christian Schulte, Guido Tack:
View-Based Propagator Derivation - (Extended Abstract). 938-942
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-04-25 05:26 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:
