Handbook randomized computing volume (8 résultats)

- Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 69,05
EUR 21,96 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In English.

- Couverture souple
Vendeur : Books Puddle, Woodside, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 109,95
EUR 3,64 expéditionExpédition nationale : Etats-UnisQuantité disponible : 4 disponibles
Etat : New. 969.

- Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 67,23
EUR 47,55 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible
Buch. 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 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.…

- Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 88,50
EUR 41,94 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponibles
Hardcover. Etat : Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.

- Couverture rigide
Vendeur : Home-set, Mannheim, AllemagneHome-set
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 66,86
EUR 67,65 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponibles
Gebundene Ausgabe. Etat : Neu. 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. Sprache: Englisch Gewicht in Gramm: 1793.…

- Couverture rigide
Vendeur : Mispah books, Redhill, SURRE, Royaume-UniMispah books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Occasion - Comme neuf
EUR 134,52
EUR 29,95 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible
Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

- Couverture souple
- impression à la demande
Vendeur : Majestic Books, Hounslow, Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 105,16
EUR 7,79 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponibles
Etat : New. Print on Demand 969.

- Couverture souple
- impression à la demande
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 106,53
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponibles
Etat : New. PRINT ON DEMAND 969.