Cantitate/Preț
Produs

Applications of Continuous Mathematics to Computer Science: Theory and Decision Library B, cartea 38

Autor Hung T. Nguyen, V. Kreinovich
en Limba Engleză Hardback – 31 oct 1997
This volume is intended to be used as a textbook for a special topic course in computer science. It addresses contemporary research topics of interest such as intelligent control, genetic algorithms, neural networks, optimization techniques, expert systems, fractals, and computer vision. The work incorporates many new research ideas, and focuses on the role of continuous mathematics.
Audience: This book will be valuable to graduate students interested in theoretical computer topics, algorithms, expert systems, neural networks, and software engineering.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 117686 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 4 dec 2010 117686 lei  6-8 săpt.
Hardback (1) 118294 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 31 oct 1997 118294 lei  6-8 săpt.

Din seria Theory and Decision Library B

Preț: 118294 lei

Preț vechi: 144262 lei
-18% Nou

Puncte Express: 1774

Preț estimativ în valută:
22640 23884$ 18867£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792347224
ISBN-10: 0792347226
Pagini: 419
Ilustrații: XII, 419 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.79 kg
Ediția:1997
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Theory and Decision Library B

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

Preface. 1. Algorithm Complexity: Two Simple Examples. 2. Solving General Linear Functional Equations: An Application to Algorithm Complexity. 3. Program Testing: A Problem. 4. Optimal Program Testing. 5. Optimal Choice of a Penalty Function: Simplest Case of Algorithm Design. 6. Solving General Linear Differential Equations with Constant Coefficients: An Application to Constrained Optimization. 7. Simulated Annealing: `Smooth' (Local) Discrete Optimization. 8. Genetic Algorithms: `Non-Smooth' Discrete Optimization. 9. RISC Computer Architecture and Internet Growth: Two Applications of Extrapolation. 10. Systems of Differential Equations and Their Use in Computer-Related Extrapolation Problems. 11. Network Congestion: An Example of Non-Linear Extrapolation. 12. Neural Networks: A General Form of Non-Linear Extrapolation. 13. Expert Systems and the Basics of Fuzzy Logic. 14. Intelligent and Fuzzy Control. 15. Randomness, Chaos, and Fractals. A: Simulated Annealing Revisited. B: Software Cost Estimation. C: Electronic Engineering: How to Describe PN-Junctions. D: Log-Normal Distribution Justified: An Application to Computational Statistics. E: Optimal Robust Statistical Methods. F: How to Avoid Paralysis of Neural Networks. G: Estimating Computer Prices. H: Allocating Bandwidth on Computer Networks. I: Algorithm Complexity Revisited. J: How Can a Robot Avoid Obstacles: Case Study of Real-Time Optimization. K: Discounting in Robot Control: A Case Study of Dynamic Optimization. Index.

Recenzii

H.T. Nguyen and V. Kreinovich
Applications of Continuous Mathematics to Computer Science
"The book represents a fine state-of-the-art description of combinatorial optimization. The book presents not only a lot of well-known solutions but also a row of new results and demonstrates how to formulate and to answer original questions. The comprehensive book covers the scope of a normal textbook on combinatorial optimization and goes beyond the contents of such a book in several aspects, e.g.; this book contains complete proofs. To read this is very stimulating for all the researchers, practitioners, and students in combinatorial optimization."—OR-NEWS