Image from Google Jackets

Principles and Practice of Constraint Programming [electronic resource] : 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings / edited by Christian Schulte.

Contributor(s): Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science ; 8124Publication details: Berlin, Heidelberg : Springer Berlin Heidelberg, 2013.Description: 1 online resource (XVIII, 898 p. 226 ill.)ISBN:
  • 9783642406270
Subject(s): Online resources:
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Status Date due Barcode Item holds
Books Books National Library of India Available EBK000024350ENG
Total holds: 0

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.

There are no comments on this title.

to post a comment.
                                                                           
web counter

Copyright ©2020 The National Library of India, Govt. of India ↔ Hosted by NVLI, MOC ↔ Technology and Design by National Library of India, Ministry of Culture, Govt. of India