Artículos relacionados a Computational Complexity and Feasibility of Data Processing...
Computational Complexity and Feasibility of Data Processing and Interval Computations: 10 (Applied Optimization) - Tapa dura
Sinopsis
Targeted audience • Specialists in numerical computations, especially in numerical optimiza tion, who are interested in designing algorithms with automatie result ver ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. • Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com plexity of numerical computations. • Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas
`The book is very well organized. The book is readable, very detailed, and intelligible. Moreover, it is exciting and gripping because the reader is often surprised by unexpected results. Everyone who is interested in modern aspects of numerical computation will enjoy reading this interesting and informative work. The book is a must for everyone who is doing research in this field.'
Mathematical Reviews, 98m
Reseña del editor
Targeted audience · Specialists in numerical computations, especially in numerical optimiza tion, who are interested in designing algorithms with automatie result ver ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. · Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com plexity of numerical computations. · Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 180,07
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Computational Complexity and Feasibility of Data Processing...
Imagen de archivo
Computational Complexity and Feasibility of Data Processing and Interval Computations
Librería: Ammareal, Morangis, Francia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Edition 1998. Tome 10. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1998. Volume 10. Ammareal gives back up to 15% of this item's net price to charity organizations. Nº de ref. del artículo: E-505-577
Cantidad disponible: 1 disponibles
Imagen de archivo
Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization)
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1000grams, ISBN:9780792348658. Nº de ref. del artículo: 8622333
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computational Complexity and Feasibility of Data Processing and Interval Computations
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Nº de ref. del artículo: 5968310
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization, 10)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780792348658_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Computational Complexity and Feasibility of Data Processing and Interval Computations
Publicado por
Springer US, Springer US, 1997
ISBN 10: 0792348656
ISBN 13: 9780792348658
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Targeted audience - Specialists in numerical computations, especially in numerical optimiza tion, who are interested in designing algorithms with automatie result ver ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. - Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com plexity of numerical computations. - Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing. Nº de ref. del artículo: 9780792348658
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computational Complexity and Feasibility of Data Processing and Interval Computations
Publicado por
Springer US, Springer US Dez 1997, 1997
ISBN 10: 0792348656
ISBN 13: 9780792348658
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Targeted audience ¿ Specialists in numerical computations, especially in numerical optimiza tion, who are interested in designing algorithms with automatie result ver ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. ¿ Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com plexity of numerical computations. ¿ Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 476 pp. Englisch. Nº de ref. del artículo: 9780792348658
Cantidad disponible: 1 disponibles
Imagen de archivo
Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization, 10)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190182711
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Computational Complexity and Feasibility of Data Processing and Interval Computations
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: Used. pp. 476. Nº de ref. del artículo: 26551460
Cantidad disponible: 1 disponibles
Imagen de archivo
Computational Complexity and Feasibility of Data Processing and Interval Computations
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Used. pp. 476 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Nº de ref. del artículo: 8377851
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computational Complexity and Feasibility of Data Processing and Interval Computations
Impresión bajo demandaLibrería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Targeted audience - Specialists in numerical computations, especially in numerical optimiza tion, who are interested in designing algorithms with automatie result ver ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. - Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com plexity of numerical computations. - Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing. 476 pp. Englisch. Nº de ref. del artículo: 9780792348658
Cantidad disponible: 2 disponibles