Cantitate/Preț
Produs
Total produse
Vezi coșul
Recent Advances in Constraints: 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 Caparica, Portugal, June 26-28, 2006 Revised Selected and Invited Papers de Francisco Azevedo

Recent Advances in Constraints: 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 Caparica, Portugal, June 26-28, 2006 Revised Selected and Invited Papers: Lecture Notes in Computer Science, cartea 4651

Editat de Francisco Azevedo, Pedro Barahona, Francois Fages, Francesca Rossi
en Limba Engleză Paperback – 27 iul 2007
Constitutes the thoroughly refereed and extended post-proceedings of the 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006, held in Caparica, Portugal in June 2006. This work focuses on global constraints, search and heuristics, language and implementation issues and modeling.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32104 lei

Preț vechi: 40130 lei
-20% Nou

Puncte Express: 482
Preț estimativ în valută:
6144€ • 6382$ • 5104£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540738169
ISBN-10: 3540738169
Pagini: 196
Ilustrații: VIII, 188 p. With online files/update.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.29 kg
Ediția:2007
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

Tutorial.- Hybrid Algorithms in Constraint Programming.- Technical Papers.- An Attempt to Dynamically Break Symmetries in the Social Golfers Problem.- A Constraint Model for State Transitions in Disjunctive Resources.- Reusing CSP Propagators for QCSPs.- Bipolar Preference Problems: Framework, Properties and Solving Techniques.- Distributed Forward Checking May Lie for Privacy.- Solving First-Order Constraints in the Theory of the Evaluated Trees.- Extracting Microstructure in Binary Constraint Networks.- Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees.- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems.- Cost-Based Filtering for Stochastic Inventory Control.