Lingua: Inglese
Editore: Dordrecht, Kluwer Acad. Publ, 2001
ISBN 10: 0792369572 ISBN 13: 9780792369578
Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 19,90
Quantità: 1 disponibili
Aggiungi al carrello456 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780792369578 Sprache: Englisch Gewicht in Gramm: 990.
Lingua: Inglese
Editore: Dordrecht, Kluwer Acad. Publ, 2001
ISBN 10: 0792369580 ISBN 13: 9780792369585
Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 19,90
Quantità: 2 disponibili
Aggiungi al carrelloXXIV S., S. 457 - 941, XXV - L S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780792369585 Sprache: Englisch Gewicht in Gramm: 990.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,16
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 73,72
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 60,14
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Kluwer Boston Incorporated, 2001
ISBN 10: 0792369599 ISBN 13: 9780792369592
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Prima edizione
EUR 76,07
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2001. 2001st Edition. hardcover. . . . . .
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 969.
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 53,95
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Kluwer Boston Incorporated, 2001
ISBN 10: 0792369599 ISBN 13: 9780792369592
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. 2001. 2001st Edition. hardcover. . . . . . Books ship from the US and Ireland.
Da: Revaluation Books, Exeter, Regno Unito
EUR 83,28
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.
EUR 50,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Handbook of Randomized Computing | Volume I/II | Sanguthevar Rajasekaran (u. a.) | Taschenbuch | l | 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.
EUR 113,32
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 103,78
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
EUR 61,18
Quantità: 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.
EUR 134,39
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. pp. 941.
EUR 174,62
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 941.
Da: UK BOOKS STORE, London, LONDO, Regno Unito
EUR 200,88
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Da: UK BOOKS STORE, London, LONDO, Regno Unito
EUR 238,44
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 1052 pp. Englisch.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 1052 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 87,78
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand 969.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 92,49
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND 969.
Lingua: Inglese
Editore: Springer, Copernicus Jul 2001, 2001
ISBN 10: 0792369599 ISBN 13: 9780792369592
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 1052 pp. Englisch.