Recent Advances in Constraints
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
Taschenbuch
BOD - 2 Tage | Lieferzeit: BOD - 2 Tage I
53,49 €*
Alle Preise inkl. MwSt.| Versandkostenfrei
Sicherheits- und Produktressourcen
Bilder und Kontakte
Sicherheitsbilder- und Kontakte
Artikelnummer:
9783540342151
Veröffentlichungsdatum:
2006
Einband:
Taschenbuch
Erscheinungsdatum:
15.05.2006
Seiten:
192
Autor:
Brahim Hnich
Gewicht:
300 g
Format:
235x155x11 mm
Sprache:
Englisch
Langbeschreibung
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.
Hauptbeschreibung
Refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005
Inhaltsverzeichnis
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.