Principles and Practice of Constraint Programming - CP'99: 5th International Conference, CP'99, Alexandria, VA, USA, October 11-14, 1999 Proceedings: Lecture Notes in Computer Science, cartea 1713
Editat de Joxan Jaffaren Limba Engleză Paperback – 29 sep 1999
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 656.36 lei
Preț vechi: 820.45 lei
-20% Nou
Puncte Express: 985
Preț estimativ în valută:
125.63€ • 130.66$ • 105.28£
125.63€ • 130.66$ • 105.28£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540666264
ISBN-10: 3540666265
Pagini: 516
Ilustrații: XII, 504 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.72 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540666265
Pagini: 516
Ilustrații: XII, 504 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.72 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- The Rough Guide to Constraint Propagation.- Non-binary Constraints.- The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization.- Regular Papers.- Operational Equivalence of CHR Programs and Constraints.- Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains.- Excluding Symmetries in Constraint-Based Search.- On Forward Checking for Non-binary Constraint Satisfaction.- Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly.- Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP.- Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time.- A Meta-Heuristic Factory for Vehicle Routing Problems.- Closure Functions and Width 1 Problems.- An Overview of HAL.- Cost-Based Domain Filtering.- Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques.- Optimal Distributed Arc-Consistency.- The Goldilocks Problem.- Multistep Filtering Operators for Ordinary Differential Equations.- A Framework for Constraint Programming Based Column Generation.- Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems.- Applying Constraint Programming to Protein Structure Determination.- Partition-Based Lower Bound for Max-CSP.- Constraint Diagram Reasoning.- Automatic Generation of Music Programs.- Search Procedures and Parallelism in Constraint Programming.- Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search.- Tight Cooperation and Its Application in Piecewise Linear Optimization.- Arc Consistency for Global Cardinality Constraints with Costs.- The Brélaz Heuristic and Optimal Static Orderings.- A Fixpoint Definition of Dynamic Constraint Satisfaction.- Solving SatisfiabilityProblems on FPGAs Using Experimental Unit Propagation.- On the Behavior and Application of Constraint Weighting.- Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization.- Poster Papers.- On SAT01 Problem.- An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support.- CSPlib: A Benchmark Library for Constraints.- Validated Constraint Compilation.- Automated Theorem Proving with Disjunctive Constraints.- Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms.- Intelligent Domain Splitting for CSPs with Ordered Domains.- Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques.
Caracteristici
Includes supplementary material: sn.pub/extras