Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,18
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 86,54
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 969.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 82,89
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 102,66
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Idioma: Inglés
Publicado por Springer US, Springer US, 2001
ISBN 10: 0792369599 ISBN 13: 9780792369592
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 61,18
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often is a collection of articles written by renowned experts in practice. This book in the area of randomized parallel computing. A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O(n logn) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all possible inputs.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 84,74
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand 969.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 89,46
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND 969.
Librería: preigu, Osnabrück, Alemania
EUR 50,35
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Handbook of Randomized Computing | Volume I/II | Sanguthevar Rajasekaran (u. a.) | Buch | 2 Bücher | Englisch | 2001 | Springer US | EAN 9780792369592 | Verantwortliche Person für die EU: Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand.