Recent Advances in Constraints de Francisco Azevedo

Recent Advances in Constraints: Lecture Notes in Computer Science

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

20%

Preț: 733^.68 lei
20%

Preț: 1032^.47 lei
20%

Preț: 1246^.46 lei
20%

Preț: 1020^.28 lei
20%

Preț: 449^.81 lei
20%

Preț: 1137^.10 lei
20%

Preț: 850^.42 lei
20%

Preț: 386^.08 lei
20%

Preț: 1022^.15 lei
20%

Preț: 620^.33 lei
20%

Preț: 620^.33 lei
20%

Preț: 1033^.45 lei
20%

Preț: 558^.53 lei
20%

Preț: 435^.28 lei
20%

Preț: 748^.63 lei
20%

Preț: 633^.70 lei
20%

Preț: 617^.17 lei
20%

Preț: 1359^.66 lei
20%

Preț: 675^.83 lei
20%

Preț: 678^.21 lei
20%

Preț: 562^.49 lei
20%

Preț: 851^.78 lei
20%

Preț: 560^.93 lei
20%

Preț: 556^.96 lei
20%

Preț: 313^.10 lei
20%

Preț: 560^.93 lei
20%

Preț: 733^.68 lei
15%

Preț: 558^.12 lei
20%

Preț: 563^.29 lei
20%

Preț: 793^.92 lei
20%

Preț: 560^.93 lei
20%

Preț: 560^.93 lei
20%

Preț: 735^.28 lei
20%

Preț: 1079^.23 lei
20%

Preț: 560^.11 lei
20%

Preț: 791^.54 lei
20%

Preț: 562^.49 lei
15%

Preț: 672^.87 lei
20%

Preț: 571^.88 lei
20%

Preț: 478^.59 lei
20%

Preț: 984^.64 lei
20%

Preț: 320^.24 lei
20%

Preț: 328^.94 lei
20%

Preț: 313^.87 lei
20%

Preț: 314^.86 lei
20%

Preț: 793^.92 lei
18%

Preț: 945^.44 lei

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.