Recent advances constraints joint (14 Ergebnisse)

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 Stochastic Constraint Programs with Linear Recourse.- The Challenge of Exploiting Weak Symmetries.- On Generators of Random Quasigroup Problems.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Constraint programming is the fruit of several decades of research carried out in mathematical logic, automated deduction, operations research and arti cial intelligence. The tools and programming languages arising from this research eldhaveenjoyedrealsuccessintheindustrialworldastheycontributetosolving hard combinatorial problems in diverse domains such as production planning, communication networks, robotics and bioinformatics. This volume contains the extended and reviewed versions of a selection of papers presented at the Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP2003), which was held from June 30 to July 2, 2003. The venue chosen for the seventh edition of this annual workshop was the Computer and Automation Research Institute of the Hungarian Academy of Sciences (MTA SZTAKI) in Budapest, Hungary. This institute is one of the 20 members of the Working Group on Constraints of the European Research Consortium for Informatics and Mathematics (ERCIM). For many participants this workshop provided the rst opportunity to visit their ERCIM partner in Budapest. CoLogNET is the European-funded network of excellence dedicated to s- porting and enhancing cooperation and research on all areas of computational logic, and continues the work done previously by the Compulog Net. In part- ular, the aim of the logic and constraint logic programming area of CoLogNET is to foster and support all research activities related to logic programming and constraint logic programming. The editors would like to take the opportunity and thank all the authors who submitted papers to this volume, as well as the reviewers for their helpful work.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Abstract Verification and Debugging of Constraint Logic Programs.- CGRASS: A System for Transforming Constraint Satisfaction Problems.- Interchangeability in Soft CSPs.- Towards Automated Reasoning on the Properties of Numerical Constraints.- Domain-Heuristics for Arc-Consistency Algorithms.- Computing Explanations and Implications in Preference-Based Configurators.- Constraint Processing Offers Improved Expressiveness and Inference for Interactive Expert Systems.- A Note on Redundant Rules in Rule-Based Constraint Programming.- A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables.- A Local Search Algorithm for Balanced Incomplete Block Designs.- The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms.- POOC - A Platform for Object-Oriented Constraint Programming.- A Coordination-Based Framework for Distributed Constraint Solving.- Visopt ShopFloor: Going Beyond Traditional Scheduling.…

Softcover. Zustand: Gut. Gebraucht - Gut Zustand: Gut, Mängelexemplar, X, 201 p. Also available online. About this book: This book constitutes the thoroughly refereed post-proceedings of the Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, held in Cork, Ireland in June 2002. The 14 revised full papers presented were carefully selected for inclusion in the book during two rounds of reviewing and revision. Among the topics addressed are verification and debugging of constraint logic programs, modeling and solving CSPs, explanation generation, inference and inconsistency processing, SAT and 0/1 encodings of CSPs, soft constraints and constraint relaxation, real-world applications, and distributed constraint solving. Written for researchers and professionals.…