Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2011-09-16
118,57 € 169,38 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 12-18 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Russ Bubley
Kirjastaja Springer London
Series Distinguished Dissertations
Väljalaskeaasta 2011
Kaanetüüp Pehme kaanega
EAN 9781447111801
Kirjuta oma arvustus
Te vaatate: Randomized Algorithms: Approximation, Generation, and Counting
Teie hinnang:

Goodreads'i arvustused

118,57 € 169,38 €