Advances in Randomized Parallel Computing

Name: Advances in Randomized Parallel Computing
Brand: Springer-Verlag New York Inc.
SKU: 9781461332848
Price: 57690 HUF
Availability: InStock

Szerző: Panos M. Pardalos, Sanguthevar Rajasekaran

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer-Verlag New York Inc.

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

57 690 Ft

The technique of randomization has been employed to solve numerous prob lems of computing both seque...

Információk a könyvről

Szerző

Panos M. Pardalos, Sanguthevar Rajasekaran

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2011

oldal

313

EAN

9781461332848

ISBN

9781461332848

Enbook ID

06620031

Kiadó

Springer-Verlag New York Inc.

Súly

507

Méretek

160 x 240 x 17

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Advances in Randomized Parallel Computing

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták