menu
{ "item_title" : "Principles and Practice of Constraint Programming", "item_author" : [" Thomas Schiex", "Simon de Givry "], "item_description" : "Technical Track.- Instance Generation via Generator Instances.- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming.- Vehicle routing by learning from historical solutions.- On Symbolic Approaches for Computing the Matrix Permanent.- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience.- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem.- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics.- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers.- Dual Hashing-based Algorithms for Discrete Integration.- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search.- A Join-Based Hybrid Parameter for Constraint Satisfaction.- An Incremental SAT-Based Approach to the Graph Colouring Problem.- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving.- Trimming Graphs Using Clausal Proof Optimization.- Improved Job Sequencing Bounds from Decision Diagrams.- Integration of structural constraints into TSP models.- Representing fitness landscapes by valued constraints to understand the complexity of local search.- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition.- Understanding the Empirical Hardness of Random Optimisation Problems.- Guarded Constraint Models Define Treewidth Preserving Reductions.- Automatic Streamlining for Constrained Optimisation.- Compiling Conditional Constraints.- Training Binarized Neural Networks using MIP and CP.- Application Track.- Models for Radiation Therapy Patient Scheduling.- Constraint Programming-based Job Dispatching for Modern HPC Applications.- Scheduling of Mobile Robots using Constraint Programming.- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems.- Multi-agent and Parallel CP Track.- An Improved GPU-based SAT Model Counter.- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems.- Testing and Verification Track.- A Cube Distribution Approach to QBF Solving and Certificate Minimization.- Functional Synthesis with Examples.- SolverCheck: Declarative Testing of Constraints.- Encodings for Enumeration-Based Program Synthesis.- Lemma Synthesis for Automating Induction over Algebraic Data Types.- CP and Data Science Track.- Modeling Pattern Set Mining using Boolean Circuits.- Differential Privacy of Hierarchical Census Data: An Optimization Approach.- Generic Constraint-based Block Modeling using Constraint Programming.- Reward Potentials for Planning with Learned Neural Network Transition Models.- Exploiting Counterfactuals for Scalable Stochastic Optimization.- Structure-driven Multiple Constraint Acquisition.- Computational Sustainability Track.- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach.- Peak-hour Rail Demand Shifting with Discrete Optimisation.- CP and Life Sciences Track.- Functional significance checking in noisy gene regulatory networks.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/03/030/047/3030300471_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Principles and Practice of Constraint Programming|Thomas Schiex

Principles and Practice of Constraint Programming : 25th International Conference, Cp 2019, Stamford, Ct, Usa, September 30 - October 4, 2019, Proceedi

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Technical Track.- Instance Generation via Generator Instances.- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming.- Vehicle routing by learning from historical solutions.- On Symbolic Approaches for Computing the Matrix Permanent.- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience.- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem.- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics.- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers.- Dual Hashing-based Algorithms for Discrete Integration.- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search.- A Join-Based Hybrid Parameter for Constraint Satisfaction.- An Incremental SAT-Based Approach to the Graph Colouring Problem.- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving.- Trimming Graphs Using Clausal Proof Optimization.- Improved Job Sequencing Bounds from Decision Diagrams.- Integration of structural constraints into TSP models.- Representing fitness landscapes by valued constraints to understand the complexity of local search.- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition.- Understanding the Empirical Hardness of Random Optimisation Problems.- Guarded Constraint Models Define Treewidth Preserving Reductions.- Automatic Streamlining for Constrained Optimisation.- Compiling Conditional Constraints.- Training Binarized Neural Networks using MIP and CP.- Application Track.- Models for Radiation Therapy Patient Scheduling.- Constraint Programming-based Job Dispatching for Modern HPC Applications.- Scheduling of Mobile Robots using Constraint Programming.- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems.- Multi-agent and Parallel CP Track.- An Improved GPU-based SAT Model Counter.- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems.- Testing and Verification Track.- A Cube Distribution Approach to QBF Solving and Certificate Minimization.- Functional Synthesis with Examples.- SolverCheck: Declarative Testing of Constraints.- Encodings for Enumeration-Based Program Synthesis.- Lemma Synthesis for Automating Induction over Algebraic Data Types.- CP and Data Science Track.- Modeling Pattern Set Mining using Boolean Circuits.- Differential Privacy of Hierarchical Census Data: An Optimization Approach.- Generic Constraint-based Block Modeling using Constraint Programming.- Reward Potentials for Planning with Learned Neural Network Transition Models.- Exploiting Counterfactuals for Scalable Stochastic Optimization.- Structure-driven Multiple Constraint Acquisition.- Computational Sustainability Track.- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach.- Peak-hour Rail Demand Shifting with Discrete Optimisation.- CP and Life Sciences Track.- Functional significance checking in noisy gene regulatory networks.

This item is Non-Returnable

Details

  • ISBN-13: 9783030300470
  • ISBN-10: 3030300471
  • Publisher: Springer
  • Publish Date: August 2019
  • Dimensions: 9.21 x 6.14 x 1.62 inches
  • Shipping Weight: 2.48 pounds
  • Page Count: 788

Related Categories

You May Also Like...

    1

BAM Customer Reviews