Tracked shipping to South Africa with premium packaging for just R199 

Ship to
South Africa
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada advances in randomized parallel computing
Type
Physical Book
Illustrated by
Publisher
Author
Year
2011
Language
English
Pages
287
Format
Paperback
Dimensions
23.4 x 15.6 x 1.7 cm
Weight
0.44 kg.
ISBN
1461332842
ISBN13
9781461332848
Categories

advances in randomized parallel computing

Panos M. Pardalos (Illustrated by) · Sanguthevar Rajasekaran (Illustrated by) · Springer · Paperback

advances in randomized parallel computing - Pardalos, Panos M. ; Rajasekaran, Sanguthevar

Cheaper New Book Imported to South Africa
Delivery: 22 Jul - 19 Aug Shipping: 13 to 17 business days.
R 2,548
Faster New Book Imported to South Africa
Delivery: 10 Jul - 04 Aug Shipping: 5 to 6 business days.
R 3,293
R 2,548

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "advances in randomized parallel computing"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews