Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Algorithms for Random Generation and Counting: A Markov Chain Approach

Name: Algorithms for Random Generation and Counting: A Markov Chain Approach
Brand: Springer, Berlin
SKU: 06794879
Price: 108.45 EUR
Availability: InStock
Author: A. Sinclair
ISBN: 9781461267072

A. Sinclair

Език

Английски език

Книга С меки корици

Код Либристо: 06794879

Издателство Springer, Berlin, март 2013

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of... Цялото описание

Код Либристо: 06794879

263 b

108.45 €

212.10 лв

Външен склад Изпращаме след 5-8 дни

До 30 дни за връщане на стоки

Клиентите са закупили също

Joseph Vernet Et La Peinture Au Xviiie Si?cle Léon Lagrange

С меки корици

27.84 € 54.46 лв

magnifici tesori della Turchia Melih Uslu

Книга

23.76 € 46.47 лв

El juego espontáneo en la escuela maternal BERNARD AUCOUTURIER

С меки корици

25.36 € 49.61 лв

Scythians and Greeks on the Western Black Sea: The Coinage of the Kings of Scythia Minor in Dobruja, 218/212-110 BCE Kleeberg Книга

С твърди корици

174.79 € 341.86 лв

Atlas Und Grundriss Der Bakteriologie Und Lehrbuch Der Speziellen Bakteriologischen Diagnostik Karl Bernhard Lehmann

С твърди корици

33.53 € 65.57 лв

Verwendung und metasprachliches Wissen über Nebensätze Matsitso Maleke

С меки корици

67.73 € 132.47 лв

Wonderland Soft Machine Аудио

Аудио плоча

18.29 € 35.76 лв

Meybüdinin Tefsirinde Tasavvuf

С меки корици

17.98 € 35.16 лв

Zadania dla asów klasa 3 Ćwiczenia dodatkowe do matematyki dla ośmiolatków i dziewięciolatków Jadwiga Stasica

С меки корици

9.76 € 19.09 лв

Une femme poète symboliste, Maria Krysinska - la Calliope du Chat noir Goulesque

С твърди корици

63.70 € 124.59 лв

Aigue Marine Cristal Gemme - La pièce 1-2 cm

binding.

7.33 € 14.34 лв

EL CÓDIGO DE LA DIABETES JASON FUNG

С твърди корици

12.19 € 23.84 лв

Stradivari viola JOAN ALFARAS

Книга

32.18 € 62.95 лв

Amnesia Amado Nervo

С меки корици

6.25 € 12.22 лв

Biomechanik und Physiotherapie für Pferde Helle Katrine Kleven

С твърди корици

25.57 € 50.01 лв

Historia de mi vida She Lao

С меки корици

17.82 € 34.85 лв

Sur Les Causes de Notre Barbarie Durand-F-M

С меки корици

12.71 € 24.85 лв

L'Empire Des Legumes: Droleries Vegetales: Memoires de Cucurbitus I Antony Meray

С меки корици

30.17 € 59.01 лв

Le nostalgie Luigi Gualdo

С твърди корици

19.01 € 37.18 лв

Regelung Mechanisch Steifer Direktantriebe F r Werkzeugmaschinen Werner Philipp

С меки корици

76.15 € 148.94 лв

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.