Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 53,42
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 59,92
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Editore: Kluwer Boston Incorporated, 2001
ISBN 10: 0792369599 ISBN 13: 9780792369592
Lingua: Inglese
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Prima edizione
EUR 78,15
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2001. 2001st Edition. hardcover. . . . . .
Da: Books Puddle, New York, NY, U.S.A.
EUR 88,61
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. 969.
Editore: Kluwer Boston Incorporated, 2001
ISBN 10: 0792369599 ISBN 13: 9780792369592
Lingua: Inglese
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 97,48
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2001. 2001st Edition. hardcover. . . . . . Books ship from the US and Ireland.
Da: Revaluation Books, Exeter, Regno Unito
EUR 83,83
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.
EUR 50,10
Convertire valutaQuantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Handbook of Randomized Computing | Volume I/II | Sanguthevar Rajasekaran (u. a.) | Taschenbuch | 2 Taschenbücher | Englisch | 2013 | Springer US | EAN 9781461348863 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 102,60
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
EUR 61,18
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
Da: Majestic Books, Hounslow, Regno Unito
EUR 87,85
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand 969.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 92,37
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND 969.