1 option
Principles and Practice of Constraint Programming - CP 2000 : 6th International Conference, CP 2000 Singapore, September 18-21, 2000 Proceedings / edited by Rina Dechter.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1894.
- Lecture Notes in Computer Science, 0302-9743 ; 1894
- Language:
- English
- Subjects (All):
- Programming languages (Electronic computers).
- Artificial intelligence.
- Computer programming.
- Computer logic.
- Logic, Symbolic and mathematical.
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Programming Techniques.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Programming Techniques.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (XII, 564 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- Contents:
- Invited Papers
- Constraint-Based Agents: The ABC's of CBA's
- Constraints for Interactive Graphical Applications
- Meta-complexity Theorems: Talk Abstract
- Regular Papers
- Automatic Generation of Propagation Rules for Finite Domains
- Extending Forward Checking
- Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
- Universally Quantified Interval Constraints
- Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
- Constraints Inference Channels and Secure Databases
- Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
- A Language for Audiovisual Template Specification and Recognition
- Random 3-SAT: The Plot Thickens
- New Tractable Classes from Old
- Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
- Cutting Planes in Constraint Programming: An Hybrid Approach
- A Constraint-Based Framework for Prototyping Distributed Virtual Applications
- A Scalable Linear Constraint Solver for User Interface Construction
- A Constraint Programming Approach for Solving Rigid Geometric Systems
- Maintaining Arc-Consistency within Dynamic Backtracking
- New Search Heuristics for Max-CSP
- Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing
- Boosting Search with Variable Elimination
- Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
- Practical Investigation of Constraints with Graph Views
- A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
- Singleton Consistencies
- Linear Formulation of Constraint Programming Models and Hybrid Solvers
- A Global Constraint Combining a Sum Constraint and Difference Constraints
- Efficient Querying of Periodic Spatiotemporal Objects
- Arc Consistency for Soft Constraints
- Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
- SAT v CSP
- Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
- Arc Consistency on n-ary Monotonic and Linear Constraints
- Poster Papers
- Some Observations on Durations, Scheduling and Allen's Algebra
- Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
- Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances
- Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
- Constraint Propagation: Between Abstract Models and ad hoc Strategies
- How to Model and Verify Concurrent Algorithms for Distributed CSPs
- The Phase Transition in Distributed Constraint Satisfaction Problems: First Results
- Cooperating Constraint Solvers
- An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic
- On Dual Encodings for Non-binary Constraint Satisfaction Problems
- Algebraic Simplification Techniques for Propositional Satisfiability
- An Original Constraint Based Approach for Solving over Constrained Problems
- An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45349-9
- 9783540453499
- 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.