Amazon cover image
Image from Amazon.com

Recent Advances in Constraints [electronic resource] : 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 /

Contributor(s): Material type: TextTextSeries: Lecture Notes in Artificial Intelligence ; 4651Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007Description: VIII, 188 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540738176
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 006.3 23
LOC classification:
  • Q334-342
  • TA347.A78
Online resources:
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.
In: Springer Nature eBook
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)
No physical items for this record

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.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in