Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

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

Anglų
2011-09-16
127,04 € 169,38 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 12-18 d.d.

30 dienų grąžinimo 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 ... Visas aprašymas

Jums taip pat gali patikti

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.

Daugiau informacijos

Autorius Russ Bubley
Leidėjas Springer London
Series Distinguished Dissertations
Išleidimo metai 2011
Viršelio tipas Minkšti viršeliai
EAN 9781447111801
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Randomized Algorithms: Approximation, Generation, and Counting
Jūsų įvertinimas:

Goodreads Atsiliepimai

127,04 € 169,38 €