A.V. Lakeyev - Böcker
Visar alla böcker från författaren A.V. Lakeyev. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
Computational Complexity and Feasibility of Data Processing and Interval Computations
Inbunden, Engelska, 1997
2 110 kr
Skickas inom 10-15 vardagar
The input data for data processing algorithms come from measurements and are therefore not precise. It is therefore necessary to estimate the accuracy of the results of data processing. Even for the simplest data processing algorithms, this problem is, however, 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 for algorithm developers, because it will enable them to concentrate on the classes of problems for which general algorithms are possible.
Del 10 - Applied Optimization
Computational Complexity and Feasibility of Data Processing and Interval Computations
Häftad, Engelska, 2010
2 101 kr
Skickas inom 10-15 vardagar
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.