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 dura
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.
- EditorialBirkhäuser
- Año de publicación1993
- ISBN 10 0817636587
- ISBN 13 9780817636586
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas160
- Contacto del fabricanteno disponible
EUR 7,64
EUR 30,68 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 51,34
EUR 14,24 gastos de envío desde Reino Unido a España
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 Generati
Librería: SecondSale, Montgomery, IL, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00085831007
Cantidad disponible: 2 disponibles
Imagen de archivo
Algorithms for Random Generati
Librería: SecondSale, Montgomery, IL, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00085830781
Cantidad disponible: 4 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach
Publicado por
Birkhauser Boston Inc, 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Antiguo o usado
Tapa dura
Librería: Ammareal, Morangis, Francia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Très bon. Ancien livre de bibliothèque avec équipements. Edition 1993. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1993. Ammareal gives back up to 15% of this item's net price to charity organizations. Nº de ref. del artículo: G-128-756
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting. a Markov Chain Approach (Progress in Theoretical Computer Science)
Publicado por
Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Nuevo
Tapa dura
Original o primera edición
Librería: Literary Cat Books, Machynlleth, Powys, WALES, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Original Boards. Condición: New. Estado de la sobrecubierta: No Dust Jacket. First Edition. In original shrinkwrap. ; Octavo; 155 pages. Nº de ref. del artículo: LCH47219
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Publicado por
Birkhäuser (edition 1993), 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Antiguo o usado
Tapa dura
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: As New. 1993. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Nº de ref. del artículo: 0817636587-10-1
Cantidad disponible: 2 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting - A Markov Chain Approach
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-82395
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach
Publicado por
Secaucus, New Jersey, U.S.A.: Birkhauser, 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Antiguo o usado
Tapa dura
Original o primera edición
Librería: Bingo Books 2, Vancouver, WA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: Near Fine. 1st Edition. hardback book in near fine condition. Nº de ref. del artículo: 126198
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Publicado por
Birkhäuser, 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Antiguo o usado
Tapa dura
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_414278867
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Publicado por
Birkhäuser, Boston
ISBN 10: 0817636587
ISBN 13: 9780817636586
Antiguo o usado
Tapa dura
Original o primera edición
Librería: Alien Bindings, BALTIMORE, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: As New. No Jacket. First Edition. Hardcover Edition practically Brand New except for a small abrasion to the front flyeaf. The covers are in great shape. The binding is square and tight. The interior pages are clean and unmarked. The book will be carefully packaged for shipment for protection from the elements. USPS electronic tracking number issued free of charge. Nº de ref. del artículo: 14908
Cantidad disponible: 1 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: 26457811
Cantidad disponible: 1 disponibles