Kniha Computational Complexity and Feasibility of Data Processing and Interval Computations V. Kreinovich

Computational Complexity and Feasibility of Data Processing and Interval Computations

Jazyk: Angličtina
Väzba: Brožovaná
Vydavateľ: Springer, Berlin
Dostupnosť: Skladom u dodávateľa
Odosielame za 5-8 dní
199.82
The input data for data processing algorithms come from measurements and are hence not precise. We t...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
2010
Stránok
459
EAN
9781441947857
ISBN
144194785X
Enbook ID
01423219
Vydavateľ
Hmotnosť
916
Rozmery
160 x 240 x 24

Kompletný popis

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.

Mohlo by vás zaujímať

Reich Rails

Taylor Blaine
30.35
16.89
219.76
15.32
256.70
49.41

Witch's Way

Shawn Robbins
23.18

Land Whisperer

Perry Carol Rosenblum Perry
12.37
21.60
20.62
25.44
22.39

Hearty

bennett
16.69
10.99

VIVALDI COLLECTION

Antonio Vivaldi
26.32

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

22.19

X-Men 4

Chris Claremont
10.41
8.18

Netzwerkmedizin

Eugen Münch
35.16