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
- 15%
Preț: 558.12 lei - 20%
Preț: 573.45 lei - 20%
Preț: 330.54 lei - 20%
Preț: 620.33 lei - 20%
Preț: 400.77 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 629.71 lei - 20%
Preț: 328.94 lei - 20%
Preț: 375.72 lei - 20%
Preț: 568.70 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 489.11 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 782.57 lei - 20%
Preț: 336.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 850.42 lei - 20%
Preț: 432.78 lei - 20%
Preț: 342.61 lei - 20%
Preț: 631.96 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 487.46 lei - 20%
Preț: 400.17 lei - 20%
Preț: 984.64 lei - 20%
Preț: 556.96 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 793.92 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 679.09 lei - 20%
Preț: 558.53 lei - 20%
Preț: 327.36 lei - 20%
Preț: 340.04 lei - 20%
Preț: 327.36 lei - 20%
Preț: 560.93 lei - 20%
Preț: 324.19 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 735.28 lei - 20%
Preț: 373.80 lei -
Preț: 395.25 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 644.63 lei
Preț vechi: 805.79 lei
-20%
Puncte Express: 967
Preț estimativ în valută:
113.96€ • 135.15$ • 98.86£
113.96€ • 135.15$ • 98.86£
Carte tipărită la comandă
Livrare economică 11-25 martie
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.