Importo totale (1 articolo articoli):
Destinazione ordine:
algorithms random generation counting di sinclair (35 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (35)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (23)
- Come nuovo, Ottimo o Quasi ottimo (7)
- Molto buono o Buono (4)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (1)
Legatura
Ulteriori caratteristiche
- Prima ed. (4)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (13)
- Non Print on Demand (27)
Lingua (2)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Da: Better World Books, Mishawaka, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Prima edizione
Condizione: Good. 1st Edition. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
Affare
EUR 13,94
Spedizione EUR 16,50
Spedito da Francia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Editore: Basel, Birkhäuser, ,, 1993
Da: Antiquariat Gothow & Motzke, Berlin, Germania
Valutazione del venditore 3 su 5 stelle
EUR 24,00
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrello146 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)
Da: Alien Bindings, BALTIMORE, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Prima edizione
Hardcover. Condizione: 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
Lingua: Inglese
Editore: Secaucus, New Jersey, U.S.A.: Birkhauser, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Da: Bingo Books 2, Vancouver, WA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Prima edizione
Hardcover. Condizione: 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)
Lingua: Inglese
Editore: Birkhäuser (edition 1993), 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Da: BooksRun, Philadelphia, PA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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 (Progress in Theoretical Computer Science)
Lingua: Inglese
Editore: Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Da: Literary Cat Books, Machynlleth, Powys, WALES, Regno Unito
Membro dell'associazione: IOBA
Valutazione del venditore 4 su 5 stelle
Prima edizione
EUR 71,28
Spedizione EUR 17,30
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloOriginal Boards. Condizione: New. Condizione sovraccoperta: No Dust Jacket. First Edition. In original shrinkwrap. ; Octavo; 155 pages.
-
Algorithms for Random Generation and Counting - A Markov Chain Approach
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 101,79
Spedizione EUR 2,25
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithms for Random Generation and Counting
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 160.
-
Algorithms for Random Generation and Counting
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 102,94
Spedizione EUR 7,50
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 103,27
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 160.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 115,50
Spedizione EUR 2,25
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 109,26
Spedizione EUR 17,30
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 114,22
Spedizione EUR 13,82
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 114,22
Spedizione EUR 13,82
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Algorithms for Random Generation and Counting : A Markov Chain Approach
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 120,69
Spedizione EUR 17,30
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Algorithms for Random Generation and Counting
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 160.
-
EUR 92,27
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
EUR 92,27
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 146,12
Spedizione EUR 28,83
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Lingua: Inglese
Editore: Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461267072 ISBN 13: 9781461267072
EUR 112,77
Spedizione EUR 61,27
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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
Lingua: Inglese
Editore: Birkhäuser Boston, Birkhäuser Boston, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
EUR 112,77
Spedizione EUR 62,06
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: 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)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 162,75
Spedizione EUR 28,83
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach (eng)
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Valutazione del venditore 4 su 5 stelle
EUR 86,24
Spedizione EUR 4,00
Spedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
-
Algorithms for Random Generation and Counting: A Markov Chain Approach
Lingua: Inglese
Editore: Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461267072 ISBN 13: 9781461267072
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
Spedizione EUR 23,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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
Lingua: Inglese
Editore: Birkhäuser Boston Feb 1993, 1993
ISBN 10: 0817636587 ISBN 13: 9780817636586
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
Spedizione EUR 23,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
