Francisco Azevedo / Pedro Barahona / Francois Fages / Francesca Rossi (eds.)

Recent Advances in Constraints

11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 Caparica, Portugal, June 26-28, 2006 Revised Selected and Invited Papers
Herausgegeben:Azevedo, Francisco; Barahona, Pedro; Fages, Francois; Rossi, Francesca

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 4651
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12096343, 978-3-540-73816-9
• Seitenzahl: 196
• Erscheinungstermin: 27. Juli 2007
• Englisch
• Abmessung: 235mm x 155mm x 11mm
• Gewicht: 310g
• ISBN-13: 9783540738169
• ISBN-10: 3540738169
• Artikelnr.: 23032723

Autorenporträt

Francisco Azevedo, 1951 in Rio de Janeiro geboren, ist ehemaliger Diplomat und langjähriger Drehbuch- und Theaterautor. Neben etlichen Theaterstücken hat er über 250 Drehbücher für Spiel- und Dokumentarfilme, preisgekrönte Multimedia- und TV-Werbespots geschrieben.

Inhaltsangabe

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.