Verwandte Artikel zu Algorithms for Random Generation and Counting: A Markov...
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 76,95
Gratis für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Algorithms for Random Generation and Counting: A Markov...
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Your Online Bookstore, Houston, TX, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: Good. Bestandsnummer des Verkäufers 0817636587-3-34999731
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generati
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Bestandsnummer des Verkäufers 00085831007
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generati
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Bestandsnummer des Verkäufers 00085830820
Anzahl: 3 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Bestandsnummer des Verkäufers Z1-B-017-02184
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Verlag:
Birkhäuser, Boston
ISBN 10: 0817636587
ISBN 13: 9780817636586
Gebraucht
Hardcover
Erstausgabe
Anbieter: Alien Bindings, BALTIMORE, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 14908
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting: A Markov Chain Approach
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers G-128-756
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting: A Markov Chain Approach
Verlag:
Secaucus, New Jersey, U.S.A.: Birkhauser, 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Gebraucht
Hardcover
Erstausgabe
Anbieter: Bingo Books 2, Vancouver, WA, USA
Verkäuferbewertung 4 von 5 Sternen
Hardcover. Zustand: Near Fine. 1st Edition. hardback book in near fine condition. Bestandsnummer des Verkäufers 126198
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: New. 1993. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped. Bestandsnummer des Verkäufers 0817636587-9-1
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting. a Markov Chain Approach (Progress in Theoretical Computer Science)
Verlag:
Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10: 0817636587
ISBN 13: 9780817636586
Neu
Hardcover
Erstausgabe
Anbieter: Literary Cat Books, Machynlleth, Powys, WALES, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Original Boards. Zustand: New. Zustand des Schutzumschlags: No Dust Jacket. First Edition. In original shrinkwrap. ; Octavo; 155 pages. Bestandsnummer des Verkäufers LCH47219
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms for Random Generation and Counting - A Markov Chain Approach
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers ABNR-82395
Anzahl: 1 verfügbar