Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 55,51
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Dordrecht, Kluwer Acad. Publ, 2001
ISBN 10 : 0792369580 ISBN 13 : 9780792369585
Langue: anglais
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
EUR 19,90
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierXXIV 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.
Edité par Dordrecht, Kluwer Acad. Publ, 2001
ISBN 10 : 0792369572 ISBN 13 : 9780792369578
Langue: anglais
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
EUR 19,90
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panier456 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.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 62,25
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 87,87
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.
Edité par Springer US, Springer US, 2001
ISBN 10 : 0792369599 ISBN 13 : 9780792369592
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 60,48
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierBuch. 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.
EUR 48,37
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 48,37
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 98,30
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. 969.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 102,90
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like New. book.
EUR 165,56
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 941.
EUR 171,05
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 941.
EUR 194,40
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : NEW. Brand New! Fast Delivery, Delivery With In 8-12 working Day Only , USA Edition Original Edition. Excellent Quality, Printing In English Language, Quick delivery by FEDEX & DHL. USPS & UPS Act. Our courier service is not available at PO BOX& APO BOX. Ship from India & United States.
EUR 231,43
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : NEW. Brand New! Fast Delivery, Delivery With In 8-12 working Day Only , USA Edition Original Edition. Excellent Quality, Printing In English Language, Quick delivery by FEDEX & DHL. USPS & UPS Act. Our courier service is not available at PO BOX& APO BOX. Ship from India & United States.
Vendeur : dsmbooks, Liverpool, Royaume-Uni
EUR 241,80
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : New. New. book.
Vendeur : dsmbooks, Liverpool, Royaume-Uni
EUR 281,40
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : New. New. book.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 53,49
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. 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 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.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 53,49
Autre deviseQuantité 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 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.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 96,77
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand 969.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 99,37
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND 969.