Cantitate/Preț
Produs

New Trends in Constraints: Joint ERCIM/Compulog Net Workshop Paphos, Cyprus, October 25-27, 1999 Selected Papers: Lecture Notes in Computer Science, cartea 1865

Editat de Krzysztof R. Apt, Antonis Kakas, Eric Monfroy, Francesca Rossi
en Limba Engleză Paperback – 23 aug 2000
This book constitutes the thoroughly refereed post-proceedings of the Joint ERCIM/Compulog-Net Workshop on New Trends in Constraints held in Paphos, Cyprus, Greece in October 1999. The 12 revised full research papers presented together with four surveys by leading researchers were carefully reviewed. The book is divided in topical sections on constraint propagation and manipulation, constraint programming, and rule-based constraint programming.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32975 lei

Preț vechi: 41219 lei
-20% Nou

Puncte Express: 495

Preț estimativ în valută:
6311 6555$ 5242£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540678854
ISBN-10: 3540678859
Pagini: 356
Ilustrații: VIII, 340 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Contributions and Surveys.- Interval Constraints: Results and Perspectives.- A Constraint-Based Language for Virtual Agents.- Constraint (Logic) Programming: A Survey on Research and Applications.- OPL Script: Composing and Controlling Models.- Constraint Propagation and Manipulation.- Some Remarks on Boolean Constraint Propagation.- Abstracting Soft Constraints.- Decomposable Constraints.- Generating Propagation Rules for Finite Domains: A Mixed Approach.- Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation.- Constraint Programming.- Combining Constraint Logic Programming Techniques for Solving Linear Problems.- Quantitative Observables and Averages in Probabilistic Constraint Programming.- Dynamic Constraint Models for Planning and Scheduling Problems.- A Finite Domain CLP Solver on Top of Mercury.- Rule-Based Constraint Programming.- Rule Based Programming with Constraints and Strategies.- Proving Termination of Constraint Solver Programs.- Projection in Adaptive Constraint Handling.

Caracteristici

Includes supplementary material: sn.pub/extras