Advertisement

© 1997

Applications of Continuous Mathematics to Computer Science

Book

Part of the Theory and Decision Library book series (TDLB, volume 38)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Hung T. Nguyen, Vladik Kreinovich
    Pages 1-20
  3. Hung T. Nguyen, Vladik Kreinovich
    Pages 45-64
  4. Hung T. Nguyen, Vladik Kreinovich
    Pages 65-86
  5. Hung T. Nguyen, Vladik Kreinovich
    Pages 87-107
  6. Hung T. Nguyen, Vladik Kreinovich
    Pages 131-152
  7. Hung T. Nguyen, Vladik Kreinovich
    Pages 153-173
  8. Hung T. Nguyen, Vladik Kreinovich
    Pages 225-250
  9. Hung T. Nguyen, Vladik Kreinovich
    Pages 251-274
  10. Hung T. Nguyen, Vladik Kreinovich
    Pages 275-296
  11. Hung T. Nguyen, Vladik Kreinovich
    Pages 297-322
  12. Hung T. Nguyen, Vladik Kreinovich
    Pages 323-350
  13. Back Matter
    Pages 351-419

About this book

Introduction

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.

Keywords

Ban algorithms complexity constant expert system fuzzy control fuzzy logic genetic algorithm logic neural network optimization robot

Authors and affiliations

  1. 1.New Mexico State UniversityLas CrucesUSA
  2. 2.University of Texas El PasoEl PasoUSA

Bibliographic information

Industry Sectors
Oil, Gas & Geosciences
Finance, Business & Banking
Electronics
Energy, Utilities & Environment
Aerospace

Reviews

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