Cantitate/Preț
Produs

On the Influence of Non-Perfect Randomness on Probabilistic Algorithms: Belastungen Und Angehorigengruppen

Autor Markus Maucher
en Limba Engleză Paperback – 30 noi 2009
Not only in computer science many problems are solved through the help of randomness. This thesis analyses probabilistic algorithms with respect to the use of random sources that do not provide perfect random numbers, like pseudorandom generators or biased sources. New theoretical results are presented that describe implications of using non-perfect random numbers with probabilistic algorithms. In the first part several probabilistic algorithms are examined on how they are influenced by random numbers that are not independent and uniformly distributed: A randomized algorithm for comparing polynomials, Karger's probabilistic algorithm for finding the minimum cut of a graph, Schöning's random walk algorithm for the Boolean Satisfiability Problem and the well-known sorting algorithm QuickSort. The second part of this work examines the impact of various sources of randomness on the quality of the solution of probabilistic optimization heuristics, concentrating on Simulated Annealing as an example for local search heuristics and a genetic algorithm as an instance of population based heuristics.
Citește tot Restrânge

Preț: 39474 lei

Preț vechi: 49343 lei
-20% Nou

Puncte Express: 592

Preț estimativ în valută:
7554 7805$ 6284£

Carte tipărită la comandă

Livrare economică 19 martie-02 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783838112312
ISBN-10: 3838112318
Pagini: 156
Dimensiuni: 152 x 229 x 9 mm
Greutate: 0.24 kg
Editura: Sudwestdeutscher Verlag Fur Hochschulschrifte