Principles and Practice of Constraint Programming - CP 2006: 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4204
Editat de Frédéric Benhamouen Limba Engleză Paperback – 26 sep 2006
Din seria Lecture Notes in Computer Science
- 20% Preț: 1043.63 lei
- 20% Preț: 334.61 lei
- 20% Preț: 336.22 lei
- 20% Preț: 445.69 lei
- 20% Preț: 238.01 lei
- 20% Preț: 334.61 lei
- 20% Preț: 438.69 lei
- Preț: 442.03 lei
- 20% Preț: 337.87 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 634.41 lei
- 17% Preț: 427.22 lei
- 20% Preț: 643.99 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1057.10 lei
- 20% Preț: 581.55 lei
- Preț: 374.84 lei
- 20% Preț: 331.36 lei
- 15% Preț: 431.22 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1390.89 lei
- 20% Preț: 1007.16 lei
- 20% Preț: 569.54 lei
- 20% Preț: 575.48 lei
- 20% Preț: 573.59 lei
- 20% Preț: 750.35 lei
- 15% Preț: 570.71 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 347.59 lei
- 20% Preț: 576.02 lei
- Preț: 404.00 lei
- 20% Preț: 586.43 lei
- 20% Preț: 750.35 lei
- 20% Preț: 812.01 lei
- 20% Preț: 649.49 lei
- 20% Preț: 344.34 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 659.25 lei
Preț vechi: 824.07 lei
-20% Nou
Puncte Express: 989
Preț estimativ în valută:
126.23€ • 131.44$ • 104.73£
126.23€ • 131.44$ • 104.73£
Carte tipărită la comandă
Livrare economică 14-28 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540462675
ISBN-10: 3540462678
Pagini: 796
Ilustrații: XVIII, 774 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 1.11 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540462678
Pagini: 796
Ilustrații: XVIII, 774 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 1.11 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
Invited Papers.- Global Optimization of Probabilistically Constrained Linear Programs.- Algorithms and Constraint Programming.- Interval Analysis and Robotics.- Constraint Based Resilience Analysis.- Regular Papers.- Infinite Qualitative Simulations by Means of Constraint Programming.- Algorithms for Stochastic CSPs.- Graph Properties Based Filtering.- The ROOTS Constraint.- CoJava: Optimization Modeling by Nondeterministic Simulation.- An Algebraic Characterisation of Complexity for Valued Constraint.- Typed Guarded Decompositions for Constraint Satisfaction.- Propagation in CSP and SAT.- The Minimum Spanning Tree Constraint.- Impact of Censored Sampling on the Performance of Restart Strategies.- Watched Literals for Constraint Propagation in Minion.- Inner and Outer Approximations of Existentially Quantified Equality Constraints.- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms.- Adaptive Clause Weight Redistribution.- Localization of an Underwater Robot Using Interval Constraint Propagation.- Approximability of Integer Programming with Generalised Constraints.- When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages.- Generalized Arc Consistency for Positive Table Constraints.- Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs.- Boosting Open CSPs.- Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs).- Distributed Constraint-Based Local Search.- High-Level Nondeterministic Abstractions in C++.- A Structural Characterization of Temporal Dynamic Controllability.- When Interval Analysis Helps Inter-block Backtracking.- Randomization in Constraint Programming for Airline Planning.- Towards an Efficient SATEncoding for Temporal Reasoning.- Decomposition of Multi-operator Queries on Semiring-Based Graphical Models.- Dynamic Lex Constraints.- Generalizing AllDifferent: The SomeDifferent Constraint.- Mini-bucket Elimination with Bucket Propagation.- Constraint Satisfaction with Bounded Treewidth Revisited.- Preprocessing QBF.- The Theory of Grammar Constraints.- Constraint Programming Models for Graceful Graphs.- A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem.- Generating Propagators for Finite Set Constraints.- Compiling Finite Linear CSP into SAT.- Differentiable Invariants.- Revisiting the Sequence Constraint.- BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs.- General Symmetry Breaking Constraints.- Poster Papers.- Inferring Variable Conflicts for Local Search.- Reasoning by Dominance in Not-Equals Binary Constraint Networks.- Distributed Stable Matching Problems with Ties and Incomplete Lists.- Soft Arc Consistency Applied to Optimal Planning.- A Note on Low Autocorrelation Binary Sequences.- Relaxations and Explanations for Quantified Constraint Satisfaction Problems.- Static and Dynamic Structural Symmetry Breaking.- The Modelling Language Zinc.- A Filter for the Circuit Constraint.- A New Algorithm for Sampling CSP Solutions Uniformly at Random.- Sports League Scheduling: Enumerative Search for Prob026 from CSPLib.- Dynamic Symmetry Breaking Restarted.- The Effect of Constraint Representation on Structural Tractability.- Failure Analysis in Backtrack Search for Constraint Satisfaction.- Heavy-Tailed Runtime Distributions: Heuristics, Models and Optimal Refutations.- An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.- Clique Inference Process for Solving Max-CSP.- Global Grammar Constraints.- Constraint Propagation for Domain Bounding in Distributed Task Scheduling.- Interactive Distributed Configuration.- Retroactive Ordering for Dynamic Backtracking.