Central Library

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 / edited by Boi Faltings, Adrian Petcu, François Fages, Francesca Rossi.

Contributor(s): Faltings, Boi [editor.] | Petcu, Adrian [editor.] | Fages, François [editor.] | Rossi, Francesca [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Artificial Intelligence: 3419Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005Edition: 1st ed. 2005.Description: X, 217 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540322528.Subject(s): Artificial intelligence | Compilers (Computer programs) | Algorithms | Computer science | Machine theory | Numerical analysis | Artificial Intelligence | Compilers and Interpreters | Algorithms | Computer Science Logic and Foundations of Programming | Formal Languages and Automata Theory | Numerical AnalysisAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 006.3 Online 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 Nature eBook
    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.