1 option
Recent Advances in Constraints : 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.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 3419.
- Lecture Notes in Artificial Intelligence ; 3419
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Programming languages (Electronic computers).
- Algorithms.
- Computer logic.
- Logic, Symbolic and mathematical.
- Numerical analysis.
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Algorithm Analysis and Problem Complexity.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Numeric Computing.
- Local Subjects:
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Algorithm Analysis and Problem Complexity.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Numeric Computing.
- Physical Description:
- 1 online resource (X, 217 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-32252-8
- 9783540322528
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.