FEEDBACK Smiley face
Normal view MARC view ISBD view

Recent Advances in Constraints [electronic resource] :Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers /

Contributor(s): Faltings, Boi V [editor.] | Petcu, Adrian [editor.] | Fages, François [editor.] | Rossi, Francesca [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 3419Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: X, 217 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540322528.Subject(s): Computer science | Programming languages (Electronic computers) | Algorithms | Computer logic | Mathematical logic | Numerical analysis | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Programming Languages, Compilers, Interpreters | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Numeric ComputingOnline resources: Click here to access online
Contents:
Constraint Propagation -- GCC-Like Restrictions on the Same Constraint -- A Note on Bilattices and Open Constraint Programming -- Pruning by Equally Constrained Variables -- Search -- Trying Again to Fail-First -- Characterization of a New Restart Strategy for Randomized Backtrack Search -- Dynamic Distributed BackJumping -- A Value Ordering Heuristic for Local Search in Distributed Resource Allocation -- Automatically Exploiting Symmetries in Constraint Programming -- New Structural Decomposition Techniques for Constraint Satisfaction Problems -- Applications -- Algorithms for the Maximum Hamming Distance Problem -- A System Prototype for Solving Multi-granularity Temporal CSP -- Computing Equilibria Using Interval Constraints -- Constraint-Based Approaches to the Covering Test Problem -- Super Solutions for Combinatorial Auctions -- Better Propagation for Non-preemptive Single-Resource Constraint Problems.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Constraint Propagation -- GCC-Like Restrictions on the Same Constraint -- A Note on Bilattices and Open Constraint Programming -- Pruning by Equally Constrained Variables -- Search -- Trying Again to Fail-First -- Characterization of a New Restart Strategy for Randomized Backtrack Search -- Dynamic Distributed BackJumping -- A Value Ordering Heuristic for Local Search in Distributed Resource Allocation -- Automatically Exploiting Symmetries in Constraint Programming -- New Structural Decomposition Techniques for Constraint Satisfaction Problems -- Applications -- Algorithms for the Maximum Hamming Distance Problem -- A System Prototype for Solving Multi-granularity Temporal CSP -- Computing Equilibria Using Interval Constraints -- Constraint-Based Approaches to the Covering Test Problem -- Super Solutions for Combinatorial Auctions -- Better Propagation for Non-preemptive Single-Resource Constraint Problems.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in