Articles liés à Algorithms for Random Generation and Counting: A Markov...
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurBirkhäuser
- Date d'édition2012
- ISBN 10 1461267072
- ISBN 13 9781461267072
- ReliureBroché
- Langueanglais
- Nombre de pages160
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 92,27
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Algorithms for Random Generation and Counting: A Markov...
Image fournie par le vendeur
Algorithms for Random Generation and Counting: A Markov Chain Approach
Edité par
Birkhäuser Boston, 2012
ISBN 10 : 1461267072
ISBN 13 : 9781461267072
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4189351
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithms for Random Generation and Counting: A Markov Chain Approach
Edité par
Birkhäuser Boston Nov 2012, 2012
ISBN 10 : 1461267072
ISBN 13 : 9781461267072
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 160 pp. Englisch. N° de réf. du vendeur 9781461267072
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Algorithms for Random Generation and Counting: A Markov Chain Approach
Edité par
Birkhäuser Boston, Birkhäuser Boston Nov 2012, 2012
ISBN 10 : 1461267072
ISBN 13 : 9781461267072
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 160 pp. Englisch. N° de réf. du vendeur 9781461267072
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Algorithms for Random Generation and Counting: A Markov Chain Approach
Edité par
Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10 : 1461267072
ISBN 13 : 9781461267072
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9781461267072
Quantité disponible : 1 disponible(s)
Image d'archives
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781461267072_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithms for Random Generation and Counting: A Markov Chain Approach
Edité par
Springer-Verlag New York Inc., 2012
ISBN 10 : 1461267072
ISBN 13 : 9781461267072
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 280. N° de réf. du vendeur C9781461267072
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2716030028195
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Edité par
Birkhäuser, 2012
ISBN 10 : 1461267072
ISBN 13 : 9781461267072
Ancien ou d'occasion
Paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA80014612670726
Quantité disponible : 1 disponible(s)