EUR 14,12
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 163,39
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 163,39
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 163,38
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 163,38
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 178,75
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 179,32
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 179,55
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 180,29
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 137,26
Quantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : New.
EUR 136,16
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 181,97
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 181,92
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par Kluwer Academic Publishers, US, 1999
ISBN 10 : 0792357140 ISBN 13 : 9780792357148
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
EUR 205,91
Quantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. 1999 ed. The technique of randomization has become very prevalent since it offers superior performance and simplicity. Numerous researchers work in this area of vital importance. Parallel Computing is also very important since one can get excellent speedups using parallel computers. This book combines these two domains. It provides a summary of the state-of-the-art results and techniques in the area of randomized parallel computing. There are few texts in the area of randomized computing, and more surprisingly there is no text in the area of randomized parallel computing. Thus our book fills the void in this very important area. Audience: This is a reference book for researchers, educators, and students. It can also be used as a text for an advanced graduate course on randomized computing, parallel computing, or distributed computing.
EUR 213,74
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New.
EUR 215,83
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 316.
EUR 168,73
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis 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( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) 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 p0:.sible inputs.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 231,22
Quantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. reprint edition. 352 pages. 9.45x6.30x0.72 inches. In Stock.
Langue: anglais
Edité par Kluwer Academic Publishers, US, 1999
ISBN 10 : 0792357140 ISBN 13 : 9780792357148
Vendeur : Rarewaves.com UK, London, Royaume-Uni
EUR 195,74
Quantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. 1999 ed. The technique of randomization has become very prevalent since it offers superior performance and simplicity. Numerous researchers work in this area of vital importance. Parallel Computing is also very important since one can get excellent speedups using parallel computers. This book combines these two domains. It provides a summary of the state-of-the-art results and techniques in the area of randomized parallel computing. There are few texts in the area of randomized computing, and more surprisingly there is no text in the area of randomized parallel computing. Thus our book fills the void in this very important area. Audience: This is a reference book for researchers, educators, and students. It can also be used as a text for an advanced graduate course on randomized computing, parallel computing, or distributed computing.
EUR 247,94
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. 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 in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis 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( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) 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 p0:.sible inputs.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 126,26
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new. Questo è un articolo print on demand.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 160,49
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis 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( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) 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 p0:.sible inputs. 316 pp. Englisch.
Langue: anglais
Edité par Springer, Springer Okt 2011, 2011
ISBN 10 : 1461332842 ISBN 13 : 9781461332848
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 160,49
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis 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( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) 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 p0:.sible inputs.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 316 pp. Englisch.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 221,76
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 223,19
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand pp. 316 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 225,56
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 226,89
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND pp. 316.