Recent Advances in Constraints: 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CS by Francisco AzevedoRecent Advances in Constraints: 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CS by Francisco Azevedo

Recent Advances in Constraints: 11th Annual ERCIM International Workshop on Constraint Solving and…

byFrancisco AzevedoEditorPedro Barahona, Francois Fages

Paperback | July 27, 2007

Pricing and Purchase Info

$104.20 online 
$124.50 list price save 16%
Earn 521 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the thoroughly refereed and extended post-proceedings of the 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006, held in Caparica, Portugal in June 2006. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.

Title:Recent Advances in Constraints: 11th Annual ERCIM International Workshop on Constraint Solving and…Format:PaperbackDimensions:188 pages, 23.5 × 15.5 × 0.07 inPublished:July 27, 2007Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540738169

ISBN - 13:9783540738169

Look for similar items by category:

Reviews

Table of Contents

Tutorial.- Hybrid Algorithms in Constraint Programming.- Technical Papers.- An Attempt to Dynamically Break Symmetries in the Social Golfers Problem.- A Constraint Model for State Transitions in Disjunctive Resources.- Reusing CSP Propagators for QCSPs.- Bipolar Preference Problems: Framework, Properties and Solving Techniques.- Distributed Forward Checking May Lie for Privacy.- Solving First-Order Constraints in the Theory of the Evaluated Trees.- Extracting Microstructure in Binary Constraint Networks.- Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees.- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems.- Cost-Based Filtering for Stochastic Inventory Control.