Montant total (1 article articles) :
Destination de la commande :
advances randomized parallel computing (32 résultats)
Passer aux résultats principaux de la recherche
Filtres de recherche
Type d'article
- Tous les types de produits
- Livres (32)
- Magazines & Périodiques (Aucun autre résultat ne correspond à ces critères)
- Bandes dessinées (Aucun autre résultat ne correspond à ces critères)
- Partitions de musique (Aucun autre résultat ne correspond à ces critères)
- Art, Affiches et Gravures (Aucun autre résultat ne correspond à ces critères)
- Photographies (Aucun autre résultat ne correspond à ces critères)
- Cartes (Aucun autre résultat ne correspond à ces critères)
- Manuscrits & Papiers anciens (Aucun autre résultat ne correspond à ces critères)
Etat En savoir plus
- Neuf (27)
- Comme neuf, Très bon ou Bon (4)
- Assez bon ou satisfaisant (1)
- Moyen ou mauvais (Aucun autre résultat ne correspond à ces critères)
- Conformément à la description (Aucun autre résultat ne correspond à ces critères)
Particularités
- Ed. originale (Aucun autre résultat ne correspond à ces critères)
- Signé (Aucun autre résultat ne correspond à ces critères)
- Jaquette (Aucun autre résultat ne correspond à ces critères)
- Avec images (16)
- Sans impressions à la demande (26)
Langue (1)
Livraison gratuite
Pays
Evaluation du vendeur
-
Advances in Randomized Parallel Computing
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 14,07
Livraison gratuite
Expédition nationale : Etats-UnisQuantité 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.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 157,35
EUR 2,24 shipping
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing (Combinatorial Optimization)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 156,18
EUR 3,39 shipping
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing (Combinatorial Optimization)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 158,73
EUR 13,75 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
-
Advances in Randomized Parallel Computing (Combinatorial Optimization, 5)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 158,73
EUR 13,75 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 158,72
EUR 17,21 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 158,72
EUR 17,21 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing (Combinatorial Optimization)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 176,73
Livraison gratuite
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 175,33
EUR 2,24 shipping
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 178,53
EUR 2,24 shipping
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 179,09
EUR 2,24 shipping
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
-
EUR 136,16
EUR 48,99 shipping
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 179,76
EUR 17,21 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
-
Advances in Randomized Parallel Computing
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 179,99
EUR 17,21 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
-
Advances in Randomized Parallel Computing
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 202,49
EUR 3,39 shipping
Expédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New.
-
Advances in Randomized Parallel Computing
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 204,31
EUR 3,39 shipping
Expédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 316.
-
Advances in Randomized Parallel Computing
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Évaluation du vendeur 5 sur 5 étoiles
EUR 194,62
EUR 10,50 shipping
Expédition depuis Irlande vers Etats-UnisQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2011. Paperback. . . . . .
-
Advances in Randomized Parallel Computing
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Évaluation du vendeur 5 sur 5 étoiles
EUR 200,27
EUR 10,50 shipping
Expédition depuis Irlande vers Etats-UnisQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 1999. 1999th Edition. hardcover. . . . . .
-
Advances in Randomized Parallel Computing
Langue: anglais
Edité par Kluwer Academic Publishers, US, 1999
ISBN 10 : 0792357140 ISBN 13 : 9780792357148
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 225,62
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. 1999 ed. 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.
-
EUR 178,14
EUR 48,99 shipping
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : New.
-
Advances in Randomized Parallel Computing
Langue: anglais
Edité par Springer US, Springer New York, 2011
ISBN 10 : 1461332842 ISBN 13 : 9781461332848
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 166,62
EUR 62,54 shipping
Expédition depuis Allemagne vers Etats-UnisQuantité 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.
-
Advances in Randomized Parallel Computing (Combinatorial Optimization)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 230,17
EUR 14,34 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. reprint edition. 352 pages. 9.45x6.30x0.72 inches. In Stock.
-
Advances in Randomized Parallel Computing
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 243,05
EUR 8,92 shipping
Expédition nationale : Etats-UnisQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2011. Paperback. . . . . . Books ship from the US and Ireland.
-
Advances in Randomized Parallel Computing
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 250,16
EUR 8,92 shipping
Expédition nationale : Etats-UnisQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 1999. 1999th Edition. hardcover. . . . . . Books ship from the US and Ireland.
-
Advances in Randomized Parallel Computing
Langue: anglais
Edité par Kluwer Academic Publishers, US, 1999
ISBN 10 : 0792357140 ISBN 13 : 9780792357148
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 215,21
EUR 74,59 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. 1999 ed. 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.
-
Advances in Randomized Parallel Computing
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 247,94
EUR 63,09 shipping
Expédition depuis Allemagne vers Etats-UnisQuantité 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.
-
Advances in Randomized Parallel Computing
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 160,49
EUR 23 shipping
Expédition depuis Allemagne vers Etats-UnisQuantité 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.
-
Advances in Randomized Parallel Computing
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
EUR 213,09
EUR 7,46 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
-
Advances in Randomized Parallel Computing
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
EUR 214,37
EUR 7,46 shipping
Expédition depuis Royaume-Uni vers Etats-UnisQuantité 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.
-
Advances in Randomized Parallel Computing
Langue: anglais
Edité par Springer US, Springer New York Okt 2011, 2011
ISBN 10 : 1461332842 ISBN 13 : 9781461332848
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 160,49
EUR 60 shipping
Expédition depuis Allemagne vers Etats-UnisQuantité 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch.
