Principles and Practice of Constraint Programming

20th International Conference, CP 2014, Lyon, France, September 8-12, 2014, Proceedings

AvBarry O'Sullivan

Häftad, Engelska, 2014

Del 8656 i serien Lecture Notes in Computer Science

1 099 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed conference proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, CP 2014, held in Lyon, France, in September 2014.The 65 revised papers presented together with 4 invited talks were carefully selected from 108 submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, and agreement technologies.

Produktinformation

Utgivningsdatum:2014-08-19
Mått:155 x 235 x 52 mm
Vikt:1 440 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:944
Förlag:Springer International Publishing AG
ISBN:9783319104270

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

A Modular Architecture for Hybrid Planning with Theories.- Teaching Constraint Programming.- One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling.- Concurrent Constraint Programming Research Programmes – Redux.- On Broken Triangles.- Using CP in Automatic Test Generation for ABB Robotics’ Paint Control System.- On Compiling CNF into Decision-DNNF.- A Complete Solver for Constraint Games.- Encoding Linear Constraints into SAT.- Efficient Application of Max-SAT Resolution on Inconsistent Subsets.- Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers.- Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem.- Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators.- The Propagation Depth of Local Consistency.- The Balance Constraint Family.- Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector.- Solving Intensional Weighted CSPs by Incremental Optimization with BDDs.- On Backdoors to Tractable Constraint Languages.- Nested Constraint Programs.- Beyond Consistency and Substitutability.- Subexponential Time Complexity of CSP with Global Constraints.- A New Characterization of Relevant Intervals for Energetic Reasoning.- A Declarative Paradigm for Robust Cumulative Scheduling.- Improving DPOP with Branch Consistency for Solving Distributed Constraint Optimization Problems.- Constraint-Based Lagrangian Relaxation.- Loop Untangling.- Discriminating Instance Generation for Automated Constraint Model Selection.- Aggregating CP-nets with Unfeasible Outcomes.- The StockingCost Constraint.- Scalable Parallel Numerical CSP Solver.- Tree-Decompositions with Connected Clusters for Solving Constraint Networks.- CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem.- On the Erd˝os Discrepancy Problem.- Towards Practical Infinite StreamConstraint Programming: Applications and Implementation.- An Increasing-Nogoods Global Constraint for Symmetry Breaking During Search.- Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.- Higher-Order Consistencies through GAC on Factor Variables.- Incremental QBF Solving.- Incremental Cardinality Constraints for MaxSAT.- Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem.- Core-Guided MaxSAT with Soft Cardinality Constraints.- The IntSat Method for Integer Linear Programming.- Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination.- Improving GAC-4 for Table and MDD Constraints.- Improvement of the Embarrassingly Parallel Search for Data Centers.- Stochastic MiniZinc.- Decomposing Utility Functions in Bounded Max-Sum for Distributed Constraint Optimization.- Insights into Parallelism with Intensive Knowledge Sharing.- The Non-overlapping Constraint between Objects Described by Non-linear Inequalities.- Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning.- Domain Views for Constraint Programming.- Global Constraints in Distributed CSP: Concurrent GAC and Explanations in ABT.- The Impact of Wireless Communication on Distributed Constraint Satisfaction.- Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports.- Proactive Workload Dispatching on the EURORA Supercomputer.- Scheduling B2B Meetings.- Solving a Judge Assignment Problem Using Conjunctions of Global Cost Functions.- Worst-Case Scheduling of Software Tasks: A Constraint Optimization Model to Support Performance Testing.- Continuous Casting Scheduling with Constraint Programming.- Case Study: Constraint Programming in a System Level Synthesis Framework.- Scheduling Agents Using Forecast Call Arrivals at Hydro-Qu´ebec’s Call Centers.- Deployment of MobileWireless Sensor Networks for Crisis Management: AConstraint-Based Local Search Approach.- Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems.- Optimization Bounds from Binary Decision Diagrams.- Reformulation Based MaxSAT Robustness.- Probabilistic Constraints for Nonlinear Inverse Problems.- Multivalued Decision Diagrams for Sequencing Problems.- Robustness and Stability in Constraint Programming under Dynamism and Uncertainty.- Monotone Temporal Planning: Tractability, Extensions and Applications.- Anytime AND/OR Depth-First Search for Combinatorial Optimization.- View-Based Propagator Derivation.