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 / Edition 1

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 / Edition 1

ISBN-10:
354034215X
ISBN-13:
9783540342151
Pub. Date:
07/06/2006
Publisher:
Springer Berlin Heidelberg
ISBN-10:
354034215X
ISBN-13:
9783540342151
Pub. Date:
07/06/2006
Publisher:
Springer Berlin Heidelberg
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 / Edition 1

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 / Edition 1

Paperback

$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.


Product Details

ISBN-13: 9783540342151
Publisher: Springer Berlin Heidelberg
Publication date: 07/06/2006
Series: Lecture Notes in Computer Science , #3978
Edition description: 2006
Pages: 179
Product dimensions: 6.10(w) x 9.25(h) x 0.36(d)

Table of 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 Shastic Constraint Programs with Linear Recourse.- The Challenge of Exploiting Weak Symmetries.- On Generators of Random Quasigroup Problems.
From the B&N Reads Blog

Customer Reviews