Artículos relacionados a Algorithms for Random Generation and Counting: A Markov...
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 162,55
EUR 28,80 gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 102,59
EUR 3,42 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Algorithms for Random Generation and Counting: A Markov...
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030028195
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach (Paperback)
Publicado por
Springer-Verlag New York Inc., New York, 2012
ISBN 10: 1461267072
ISBN 13: 9781461267072
Nuevo
Paperback
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781461267072
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9781461267072_new
Gastos de envío:
EUR 13,80
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Algorithms for Random Generation and Counting: A Markov Chain Approach
Publicado por
Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461267072
ISBN 13: 9781461267072
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9781461267072
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Condición: New. 2012. Paperback. . . . . . Nº de ref. del artículo: V9781461267072
Gastos de envío:
EUR 10,50
De Irlanda a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 15 disponibles
Imagen del vendedor
Algorithms for Random Generation and Counting: A Markov Chain Approach
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: 4189351
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 160. Nº de ref. del artículo: 2648029318
Cantidad disponible: 4 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 160 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 44786009
Gastos de envío:
EUR 7,49
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 4 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 160. Nº de ref. del artículo: 1848029324
Gastos de envío:
EUR 9,95
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 4 disponibles
Imagen del vendedor
Algorithms for Random Generation and Counting: A Markov Chain Approach
Publicado por
Birkhäuser, Birkhäuser Nov 2012, 2012
ISBN 10: 1461267072
ISBN 13: 9781461267072
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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 Nature c/o IBS, Benzstrasse 21, 48619 Heek 160 pp. Englisch. Nº de ref. del artículo: 9781461267072
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles