Cantitate/Preț
Produs

Discrete Probability and Algorithms: The IMA Volumes in Mathematics and its Applications, cartea 72

Editat de David Aldous, Persi Diaconis, Joel Spencer, J. Michael Steele
en Limba Engleză Hardback – 29 iun 1995
Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.
Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 65464 lei  6-8 săpt.
  Springer – 28 sep 2012 65464 lei  6-8 săpt.
Hardback (1) 60707 lei  6-8 săpt.
  Springer – 29 iun 1995 60707 lei  6-8 săpt.

Din seria The IMA Volumes in Mathematics and its Applications

Preț: 60707 lei

Preț vechi: 71420 lei
-15% Nou

Puncte Express: 911

Preț estimativ în valută:
11620 12494$ 9687£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387945323
ISBN-10: 0387945326
Pagini: 158
Ilustrații: XVII, 158 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.43 kg
Ediția:1995
Editura: Springer
Colecția Springer
Seria The IMA Volumes in Mathematics and its Applications

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

On simulating a Markov chain stationary distribution when transition probabilities are unknown.- A note on network reliability.- Rectangular arrays with fixed margins.- Three examples of Monte-Carlo Markov chains: at the interface between statistical computing, computer science, and statistical mechanics.- The move-to-front rule for self-organizing lists with Markov dependent requests.- The asymptotic lower bound on the diagonal Ramsey numbers: A closer look.- Random walks and undirected graph connectivity: A survey.- Sidon sets with small gaps.- Variations on the monotone subsequence theme of Erd?s and Szekeres.- Randomised approximation schemes for Tutte-Gröthendieck invariants.- Quasi-additive Euclidean functionals.