Amazon cover image
Image from Amazon.com

Recent Advances in Constraints [electronic resource] : Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers /

Contributor(s): Material type: TextTextSeries: Lecture Notes in Artificial Intelligence ; 3978Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006Description: VIII, 179 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540342168
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 338.47004 23
LOC classification:
  • HD9696.2-9696.82
Online resources:
Contents:
Global Constraints -- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables -- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains -- Among, Common and Disjoint Constraints -- Search and Heuristics -- Partitioning Based Algorithms for Some Colouring Problems -- A CSP Search Algorithm with Reduced Branching Factor -- Analysis of Heuristic Synergies -- Complexity Analysis of Heuristic CSP Search Algorithms -- Language and Implementation Issues -- A Type System for CHR -- Views and Iterators for Generic Constraint Implementations -- Modeling -- A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse -- The Challenge of Exploiting Weak Symmetries -- On Generators of Random Quasigroup Problems.
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

Global Constraints -- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables -- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains -- Among, Common and Disjoint Constraints -- Search and Heuristics -- Partitioning Based Algorithms for Some Colouring Problems -- A CSP Search Algorithm with Reduced Branching Factor -- Analysis of Heuristic Synergies -- Complexity Analysis of Heuristic CSP Search Algorithms -- Language and Implementation Issues -- A Type System for CHR -- Views and Iterators for Generic Constraint Implementations -- Modeling -- A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse -- The Challenge of Exploiting Weak Symmetries -- On Generators of Random Quasigroup Problems.

There are no comments on this title.

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