Principles and Practice of Constraint Programing-CP 2013 : 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013, Proceedings - Livres de poche

EAN (ISBN-13): 9783642406263
ISBN (ISBN-10): 3642406262
Version reliée
Livre de poche
Date de parution: 2013
Editeur: Springer Berlin

Livre dans la base de données depuis 2014-01-13T21:57:44+01:00 (Paris)
Page de détail modifiée en dernier sur 2023-03-17T10:53:51+01:00 (Paris)
ISBN/EAN: 9783642406263

ISBN - Autres types d'écriture:
3-642-40626-2, 978-3-642-40626-3
Autres types d'écriture et termes associés:
Auteur du livre: schult, christian schulte
Titre du livre: proceedings engineering, international proceedings, programming principles and practice, 2013, 8124, schulte

---

Données de l'éditeur

Auteur: Christian Schulte
Titre: Lecture Notes in Computer Science; Programming and Software Engineering; Principles and Practice of Constraint Programing-CP 2013 - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013, Proceedings
Editeur: Springer; Springer Berlin
898 Pages
Date de parution: 2013-08-21
Berlin; Heidelberg; DE
Imprimé / Fabriqué en
Poids: 1,377 kg
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
XVIII, 898 p. 226 illus.

BC; Mathematical Logic and Formal Languages; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; chaotic dynamical systems; combinatorial optimization; constraint programming; topological entropy; tractability; algorithm analysis and problem complexity; Numeric Computing; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Discrete Mathematics in Computer Science; Programming Languages, Compilers, Interpreters; Formal Languages and Automata Theory; Numerical Analysis; Algorithms; Computer Science Logic and Foundations of Programming; Discrete Mathematics in Computer Science; Compilers and Interpreters; Numerische Mathematik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Compiler und Übersetzer; EA

Invited Talks.- Optimization for Policy Making: The Cornerstone for an Integrated Approach.- Answer Set Programming: Boolean Constraint Solving for Knowledge Representation and Reasoning.- Those Who Cannot Remember the Past Are Condemned to Repeat It.- Invited Public Lecture.- Decide Different!.- Invited System Presentation.- The Objective-CP Optimization System.- Best Technical Track Paper.- Parallel Discrepancy-Based Search.- Best Application Track Paper.- Bin Packing with Linear Usage Costs – An Application to Energy in Data Centres.- Best Student Paper.- Filtering At Most N Value with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem.- Technical Track Papers.- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints.- To Encode or to Propagate? The Best Choice for Each Constraint in SAT.- Automated Symmetry Breaking and Model Selection in Conjure.- Improving WPM2 for (Weighted) Partial MaxSAT.- MinSAT versus MaxSAT for Optimization Problems.- Adaptive Parameterized Consistency.- Global Inverse Consistency for Interactive Constraint Satisfaction.- Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems.- On the Reduction of the CSP Dichotomy Conjecture to Digraphs.- A Scalable Approximate Model Counter.- Dominance Driven Search.- Tractable Combinations of Global Constraints.- Postponing Optimization to Speed Up MAXSAT Solving.- Dead-End Elimination for Weighted CSP.- Solving Weighted CSPs by Successive Relaxations.- Constraint-Based Program Reasoning with Heaps and Separation.- Model Combinators for Hybrid Optimization.- Modelling Destructive Assignments.- An Improved Search Algorithm for Min-Perturbation.- Explaining Propagators for Edge-Valued Decision Diagrams.- A Simple and Effective Decomposition for the Multidimensional Bin packing Constraint.- Maintaining Soft Arc Consistencies in BnB-ADOPT+ during Search.- Solving String Constraints: The Case for Constraint Programming.- Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction.- Solving QBF with Free Variables.- Globalizing Constraint Models.- A New Propagator for Two-Layer Neural Networks in Empirical Model Learning.- Bandit-Based Search for Constraint Programming.-Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability.- Multi-Objective Constraint Optimization with Tradeoffs.- Multidimensional Bin Packing Revisited.- A Parametric Propagator for Discretely Convex Pairs of Sum Constraints.- Breaking Symmetry with Different Orderings.-Time-Table Extended-Edge-Finding for the Cumulative Constraint.- Revisiting the Cardinality Reasoning for Bin Packing Constraint.-Value Interchangeability in Scenario Generation.-Embarrassingly Parallel Search.-Multi-Objective Large Neighborhood Search.- Scheduling Optional Tasks with Explanation.- Residential Demand Response under Uncertainty.- Lifting Structural Tractability to CSP with Global Constraints.- Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers.- Primal and Dual Encoding from Applications into Quantified Boolean Formulas.-Asynchronous Forward Bounding Revisited.- Optimizing STR Algorithms with Tuple Compression.- Application Track Papers.- Describing and Generating Solutions for the EDF Unit Commitment Problem with the Model Seeker.-Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search.-Constraint-Based Approaches for Balancing Bike Sharing Systems.- Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems.-Laser Cutting Path Planning Using CP.-Atom Mapping with Constraint Programming.-Beyond Feasibility: CP Usage in Constrained-Random Functional Hardware -Verification.-Stochastic Local Search Based Channel Assignment in Wireless Mesh Networks.-Automatic Generation and Delivery of Multiple-Choice Math Quizzes. Constrained Wine Blending.- The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach.