Advances in Randomized Parallel Computing: 5 (Combinatorial Optimization) - Hardcover

Pardalos, M. Pardalos

 
9780792357148: Advances in Randomized Parallel Computing: 5 (Combinatorial Optimization)
Hardcover
ISBN 10: 0792357140 ISBN 13: 9780792357148
Verlag: Springer, 1999

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
1999
Sprache
Englisch
ISBN 10 
0792357140
ISBN 13 
9780792357148
Einband
Tapa dura
Anzahl der Seiten
316
Herausgeber
Pardalos P. M., Pardalos Panos M.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9781461332848: Advances in Randomized Parallel Computing: 5 (Combinatorial Optimization)

Vorgestellte Ausgabe

ISBN 10:  1461332842 ISBN 13:  9781461332848
Verlag: Springer, 2011
Softcover