Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Randomized Algorithms: Approximation, Generation, and Counting - Russ Bubley

angļu valoda
2011-09-16
118,57 € 169,38 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 12-18 darba dienu laikā

30 dienu atgriešanas politika

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized A ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.

Vairāk informācijas

Autors Russ Bubley
Izdevējs Springer London
Series Distinguished Dissertations
Izlaides gads 2011
Vāka tips Mīkstais vāks
EAN 9781447111801
Rakstiet savu atsauksmi
Jūs vērtējat: Randomized Algorithms: Approximation, Generation, and Counting
Jūsu novērtējums:

Goodreads atsauksmes

118,57 € 169,38 €