Constraint Programming and Decision Making: Studies in Computational Intelligence, cartea 539
Editat de Martine Ceberio, Vladik Kreinovichen Limba Engleză Paperback – 27 aug 2016
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 588.78 lei 38-45 zile | |
Springer International Publishing – 27 aug 2016 | 588.78 lei 38-45 zile | |
Springer International Publishing – 18 mai 2018 | 625.13 lei 6-8 săpt. | |
Hardback (2) | 600.12 lei 38-45 zile | |
Springer International Publishing – 3 feb 2014 | 600.12 lei 38-45 zile | |
Springer International Publishing – 18 sep 2017 | 630.95 lei 6-8 săpt. |
Din seria Studies in Computational Intelligence
- 50% Preț: 264.47 lei
- 70% Preț: 235.74 lei
- 20% Preț: 1134.78 lei
- 20% Preț: 966.66 lei
- 20% Preț: 938.57 lei
- 20% Preț: 1423.29 lei
- 20% Preț: 168.78 lei
- 18% Preț: 1089.74 lei
- 20% Preț: 636.14 lei
- 20% Preț: 1026.49 lei
- 20% Preț: 1546.90 lei
- 20% Preț: 630.47 lei
- 20% Preț: 644.20 lei
- 20% Preț: 973.14 lei
- 20% Preț: 970.73 lei
- 20% Preț: 969.90 lei
- 20% Preț: 1142.04 lei
- 20% Preț: 1415.20 lei
- 20% Preț: 1020.82 lei
- 20% Preț: 1026.49 lei
- 20% Preț: 1024.85 lei
- 18% Preț: 2449.69 lei
- 20% Preț: 969.09 lei
- 20% Preț: 1142.04 lei
- 20% Preț: 1140.44 lei
- 20% Preț: 1021.64 lei
- 20% Preț: 1430.55 lei
- 18% Preț: 1375.05 lei
- 18% Preț: 1102.11 lei
- 20% Preț: 1018.40 lei
- 20% Preț: 987.68 lei
- 20% Preț: 1024.07 lei
- 20% Preț: 1249.53 lei
- 20% Preț: 1019.22 lei
- 20% Preț: 968.30 lei
- 20% Preț: 1146.08 lei
- 20% Preț: 1138.80 lei
- 20% Preț: 1037.78 lei
- 20% Preț: 1140.44 lei
- 20% Preț: 1142.87 lei
- 20% Preț: 1429.76 lei
- 18% Preț: 985.35 lei
- 20% Preț: 977.17 lei
- 20% Preț: 1034.54 lei
- 20% Preț: 1258.40 lei
- 20% Preț: 973.92 lei
- 20% Preț: 1027.45 lei
- 20% Preț: 924.65 lei
- 20% Preț: 1149.31 lei
- 20% Preț: 1428.13 lei
Preț: 588.78 lei
Preț vechi: 735.97 lei
-20% Nou
Puncte Express: 883
Preț estimativ în valută:
112.67€ • 118.80$ • 93.80£
112.67€ • 118.80$ • 93.80£
Carte tipărită la comandă
Livrare economică 06-13 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319382029
ISBN-10: 3319382020
Ilustrații: XII, 209 p. 33 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.32 kg
Ediția:Softcover reprint of the original 1st ed. 2014
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Computational Intelligence
Locul publicării:Cham, Switzerland
ISBN-10: 3319382020
Ilustrații: XII, 209 p. 33 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.32 kg
Ediția:Softcover reprint of the original 1st ed. 2014
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Computational Intelligence
Locul publicării:Cham, Switzerland
Cuprins
Algorithmics of Checking Whether a Mapping Is Injective, Surjective,
and/or Bijective.-
Simplicity Is Worse Than Theft: A Constraint-Based Explanation of a
Seemingly Counter-Intuitive Russian Saying.-
Continuous If-Then Statements Are Computable.-
Linear programming with Interval Type-2 fuzzy constraints.-
Epistemic Considerations on Expert Disagreement, Normative Justification, and Inconsistency Regarding Multi-Criteria Decision Making .-Interval Linear Programming Techniques in Constraint Programming
and Global Optimization.-Selecting the Best Location for a Meteorological Tower: A Case Study
of Multi-Objective Constraint Optimization.-Gibbs Sampling as a Natural Statistical Analog of Constraints
Techniques: Prediction in Science under General Probabilistic Uncertainty .-Why Tensors.-Adding Constraints – A (Seemingly Counterintuitive but) Useful
Heuristic in Solving Difficult Problems.-Under Physics-Motivated Constraints, Generally-Non-Algorithmic Computational Problems Become Algorithmically Solvable.-
Constraint-Related Reinterpretation of Fundamental Physical
Equations Can Serve as a Built-In Regularization.-Optimization of the Choquet Integral using Genetic Algorithm .-
Optimization of the Choquet Integral using Genetic Algorithm .-
Scalable, Portable, Verifiable Kronecker Products on Multi-Scale
Computers.-
Reliable and
Robust Synthesis of QFT controller using ICSP.- Towards an Efficient Bisection of Ellipsoids .-
.-An Auto-validating Rejection Sampler for Differentiable Arithmetical
Expressions: Posterior Sampling of Phylogenetic Quartets.-
Graph Subdivision Methods in Interval Global Optimization .-
An Extended BDI-Based Model for Human Decision-Making and Social
Behavior: Various Applications .-
Why Curvature in L-Curve: Combining Soft Constraints .-
Surrogate Models for Mixed Discrete-Continuous Variables
Why Ellipsoid Constraints, Ellipsoid Clusters, and Riemannian
Space-Time: Dvoretzky’s Theorem Revisited
and/or Bijective.-
Simplicity Is Worse Than Theft: A Constraint-Based Explanation of a
Seemingly Counter-Intuitive Russian Saying.-
Continuous If-Then Statements Are Computable.-
Linear programming with Interval Type-2 fuzzy constraints.-
Epistemic Considerations on Expert Disagreement, Normative Justification, and Inconsistency Regarding Multi-Criteria Decision Making .-Interval Linear Programming Techniques in Constraint Programming
and Global Optimization.-Selecting the Best Location for a Meteorological Tower: A Case Study
of Multi-Objective Constraint Optimization.-Gibbs Sampling as a Natural Statistical Analog of Constraints
Techniques: Prediction in Science under General Probabilistic Uncertainty .-Why Tensors.-Adding Constraints – A (Seemingly Counterintuitive but) Useful
Heuristic in Solving Difficult Problems.-Under Physics-Motivated Constraints, Generally-Non-Algorithmic Computational Problems Become Algorithmically Solvable.-
Constraint-Related Reinterpretation of Fundamental Physical
Equations Can Serve as a Built-In Regularization.-Optimization of the Choquet Integral using Genetic Algorithm .-
Optimization of the Choquet Integral using Genetic Algorithm .-
Scalable, Portable, Verifiable Kronecker Products on Multi-Scale
Computers.-
Reliable and
Robust Synthesis of QFT controller using ICSP.- Towards an Efficient Bisection of Ellipsoids .-
.-An Auto-validating Rejection Sampler for Differentiable Arithmetical
Expressions: Posterior Sampling of Phylogenetic Quartets.-
Graph Subdivision Methods in Interval Global Optimization .-
An Extended BDI-Based Model for Human Decision-Making and Social
Behavior: Various Applications .-
Why Curvature in L-Curve: Combining Soft Constraints .-
Surrogate Models for Mixed Discrete-Continuous Variables
Why Ellipsoid Constraints, Ellipsoid Clusters, and Riemannian
Space-Time: Dvoretzky’s Theorem Revisited
Textul de pe ultima copertă
In many application areas, it is necessary to make effective decisions under constraints. Several area-specific techniques are known for such decision problems; however, because these techniques are area-specific, it is not easy to apply each technique to other applications areas. Cross-fertilization between different application areas is one of the main objectives of the annual International Workshops on Constraint Programming and Decision Making. Those workshops, held in the US (El Paso, Texas), in Europe (Lyon, France), and in Asia (Novosibirsk, Russia), from 2008 to 2012, have attracted researchers and practitioners from all over the world. This volume presents extended versions of selected papers from those workshops. These papers deal with all stages of decision making under constraints: (1) formulating the problem of multi-criteria decision making in precise terms, (2) determining when the corresponding decision problem is algorithmically solvable; (3) finding the corresponding algorithms, and making these algorithms as efficient as possible; and (4) taking into account interval, probabilistic, and fuzzy uncertainty inherent in the corresponding decision making problems. The resulting application areas include environmental studies (selecting the best location for a meteorological tower), biology (selecting the most probable evolution history of a species), and engineering (designing the best control for a magnetic levitation train).
Caracteristici
Presents extended versions of selected papers from the recent annual International Workshops on Constraint Programming and Decision Making held in the US (El Paso, Texas), in Europe (Lyon, France), and in Asia (Novosibirsk, Russia) from 2008 to 2012 The presented research deals with all stages of decision making under constraints: (1) formulating the problem of multi-criteria decision making in precise terms, (2) determining when the corresponding decision problem is algorithmically solvable; (3) finding the corresponding algorithms, and making these algorithms as efficient as possible and (4) taking into account interval, probabilistic and fuzzy uncertainty inherent in the corresponding decision making problems Written by experts in the field