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 / edited by Brahim Hnich, Mats Carlsson, François Fages, Francesca Rossi.

Contributor(s): Hnich, Brahim [editor.] | Carlsson, Mats [editor.] | Fages, François [editor.] | Rossi, Francesca [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 3978Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: VIII, 179 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540342168Subject(s): Computer science | Computer software | Logic design | Electronic data processing | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Programming Languages, Compilers, Interpreters | Logics and Meanings of Programs | Algorithm Analysis and Problem Complexity | Numeric Computing | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access online
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 eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4096

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.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha