Applications of Continuous Mathematics to Computer Science

V. Kreinovich

ISBN 10: 9048149010 / ISBN 13: 9789048149018

Published by Springer Netherlands, Springer Netherlands, 2010

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9789048149018

Bibliographic Details

• Title: Applications of Continuous Mathematics to Computer Science
• Publisher: Springer Netherlands, Springer Netherlands
• Publication Date: 2010
• Language: English
• ISBN 10: 9048149010
• ISBN 13: 9789048149018
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 279W x 210H x 24D millimeters 279 millimeters width by 210 millimeters height by 24 millimeters depth
• Weight: 1056 grams

About this title

Synopsis

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.

Review

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