Hnich

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
Herausgegeben:Hnich, Brahim; Carlsson, Mats; Fages, Francois; Rossi, Francesca

• Broschiertes Buch

Produktbeschreibung

This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 3978
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 11754602, 978-3-540-34215-1
• 2006
• Seitenzahl: 192
• Erscheinungstermin: 15. Mai 2006
• Englisch
• Abmessung: 235mm x 155mm x 11mm
• Gewicht: 277g
• ISBN-13: 9783540342151
• ISBN-10: 354034215X
• Artikelnr.: 20946653

Inhaltsangabe

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.