Książka Computational Complexity and Feasibility of Data Processing and Interval Computations V. Kreinovich

Computational Complexity and Feasibility of Data Processing and Interval Computations

Język: Angielski
Oprawa: Miękka
Wydawca: Springer, Berlin
Dostępność: Dostępna u dostawcy
Wysyłamy za 5-8 dni
845.73
The input data for data processing algorithms come from measurements and are hence not precise. We t...

Informacje o książce

Język
Angielski
Oprawa
Książka - Miękka
Data wydania
2010
strony
459
EAN
9781441947857
ISBN
144194785X
Enbook ID
01423219
Waga
916
Wymiary
160 x 240 x 24

Pełny opis

The input data for data processing algorithms come from measurements and are hence not precise. We therefore need to estimate the accuracy of the results of data processing. It turns out that even for the simplest data processing algorithms, this problem is, in general, intractable. This book describes for what classes of problems interval computations (i.e. data processing with automatic results verification) are feasible, and when they are intractable. This knowledge is important, e.g. for algorithm developers, because it will enable them to concentrate on the classes of problems for which general algorithms are possible.

Możesz być zainteresowany

Reich Rails

Taylor Blaine
128.60
75.25
930.23
64.93
1 137.02
219.72

Witch's Way

Shawn Robbins
77.10

Land Whisperer

Perry Carol Rosenblum Perry
55.87
97.54
87.32
107.57
101.14

Hearty

bennett
72.52
49.74

VIVALDI COLLECTION

Antonio Vivaldi
111.66

Klienci, którzy kupili tę książkę, kupili również

98.91

X-Men 4

Chris Claremont
43.02
33.48

Netzwerkmedizin

Eugen Münch
155.66