Get 40% off select Statistics books or choose from thousands of Archive eBooks at 9.99 each!

Theory and Decision Library B
cover

Applications of Continuous Mathematics to Computer Science

Authors: Hung T. Nguyen, Kreinovich, V.

Buy this book

eBook $229.00
price for USA in USD (gross)
  • ISBN 978-94-017-0743-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $299.99
price for USA in USD
  • ISBN 978-0-7923-4722-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $299.99
price for USA in USD
  • ISBN 978-90-481-4901-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

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


Table of contents (15 chapters)

Table of contents (15 chapters)
  • Algorithm Complexity: Two Simple Examples

    Pages 1-20

    Nguyen, Hung T. (et al.)

  • Solving General Linear Functional Equations: an Application to Algorithm Complexity

    Pages 21-44

    Nguyen, Hung T. (et al.)

  • Program Testing: A Problem

    Pages 45-64

    Nguyen, Hung T. (et al.)

  • Optimal Program Testing

    Pages 65-86

    Nguyen, Hung T. (et al.)

  • Optimal Choice of a Penalty Function: Simplest Case of Algorithm Design

    Pages 87-107

    Nguyen, Hung T. (et al.)

Buy this book

eBook $229.00
price for USA in USD (gross)
  • ISBN 978-94-017-0743-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $299.99
price for USA in USD
  • ISBN 978-0-7923-4722-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $299.99
price for USA in USD
  • ISBN 978-90-481-4901-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Services for this Book

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Applications of Continuous Mathematics to Computer Science
Authors
Series Title
Theory and Decision Library B
Series Volume
38
Copyright
1997
Publisher
Springer Netherlands
Copyright Holder
Springer Science+Business Media Dordrecht
eBook ISBN
978-94-017-0743-5
DOI
10.1007/978-94-017-0743-5
Hardcover ISBN
978-0-7923-4722-4
Softcover ISBN
978-90-481-4901-8
Edition Number
1
Number of Pages
XII, 419
Topics