Gesamtpreis (1 Artikel Artikel):
Versandziel:
algorithms random generation counting von sinclair (34 Ergebnisse)
Direkt zu den wichtigsten Suchergebnissen
Suchfilter
Produktart
- Alle Product Types
- Bücher (34)
- Magazine & Zeitschriften (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Comics (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Noten (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Kunst, Grafik & Poster (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Fotografien (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Karten (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Manuskripte & Papierantiquitäten (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
Zustand Mehr dazu
- Neu (25)
- Wie Neu, Sehr Gut oder Gut Bis Sehr Gut (7)
- Gut oder Befriedigend (1)
- Ausreichend oder Schlecht (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Wie beschrieben (1)
Weitere Eigenschaften
- Erstausgabe (3)
- Signiert (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Schutzumschlag (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Angebotsfoto (14)
- Keine Print-on-Demand Angebote (27)
Sprache (2)
Gratisversand
Land des Verkäufers
Verkäuferbewertung
-
Algorithms for random generation and counting: a Markov chain approach.
Verlag: Basel, Birkhäuser, ,, 1993
Anbieter: Antiquariat Gothow & Motzke, Berlin, Deutschland
Verkäuferbewertung 3 von 5 Sternen
146 S./pp., Originalpappband (publisher's cardboard covers), (Progress in Theoretical Computer Science), Sprache: englisch.
-
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
EUR 42,01
EUR 12,12 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbZustand: 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.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Alien Bindings, BALTIMORE, MD, USA
Verkäuferbewertung 4 von 5 Sternen
Erstausgabe
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.
-
Algorithms for Random Generation and Counting. a Markov Chain Approach (Progress in Theoretical Computer Science)
Sprache: Englisch
Verlag: Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Anbieter: Literary Cat Books, Machynlleth, Powys, WALES, Vereinigtes Königreich
Verbandsmitglied: IOBA
Verkäuferbewertung 3 von 5 Sternen
Erstausgabe
EUR 49,27
EUR 15,94 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbOriginal Boards. Zustand: New. Zustand des Schutzumschlags: No Dust Jacket. First Edition. In original shrinkwrap. ; Octavo; 155 pages.
-
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.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sprache: Englisch
Verlag: Secaucus, New Jersey, U.S.A.: Birkhauser, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Anbieter: Bingo Books 2, Vancouver, WA, USA
Verkäuferbewertung 5 von 5 Sternen
Erstausgabe
Hardcover. Zustand: Near Fine. 1st Edition. hardback book in near fine condition.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Sprache: Englisch
Verlag: Birkhäuser (edition 1993), 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
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.
-
-
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.
-
Zustand: New. pp. 160.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: ALLBOOKS1, Direk, SA, Australien
Verkäuferbewertung 5 von 5 Sternen
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 101,85
EUR 3,40 shipping
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 103,35
EUR 2,25 shipping
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 102,18
EUR 3,40 shipping
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
Algorithms for Random Generation and Counting
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 102,22
EUR 7,40 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 160 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Algorithms for Random Generation and Counting
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 160.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 120,84
EUR 2,25 shipping
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 107,88
EUR 17,08 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
EUR 92,27
EUR 48,99 shipping
Versand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
Zustand: New. pp. 160.
-
EUR 92,27
EUR 48,99 shipping
Versand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbGebunden. Zustand: New.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 126,29
EUR 17,08 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 139,59
EUR 28,47 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Taschenbuch. Zustand: Neu. Algorithms for Random Generation and Counting: A Markov Chain Approach | A. Sinclair | Taschenbuch | viii | Englisch | 2012 | Birkhäuser | EAN 9781461267072 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sprache: Englisch
Verlag: Birkhäuser Boston, Birkhäuser Boston, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sprache: Englisch
Verlag: Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461267072 ISBN 13: 9781461267072
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 160,71
EUR 28,47 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sprache: Englisch
Verlag: Birkhäuser Boston Feb 1993, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sprache: Englisch
Verlag: Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461267072 ISBN 13: 9781461267072
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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.
-
Algorithms for Random Generation and Counting
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 149,23
EUR 7,40 shipping
Versand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
In den WarenkorbZustand: 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.
