An edition of Computational Probability (2000)

Computational Probability

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by ImportBot
August 2, 2020 | History
An edition of Computational Probability (2000)

Computational Probability

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Great advances have been made in recent years in the field of computational probability. In particular, the state of the art - as it relates to queuing systems, stochastic Petri-nets and systems dealing with reliability - has benefited significantly from these advances. The objective of this book is to make these topics accessible to researchers, graduate students, and practitioners. Great care was taken to make the exposition as clear as possible. Every line in the book has been evaluated, and changes have been made whenever it was felt that the initial exposition was not clear enough for the intended readership. The work of major research scholars in this field comprises the individual chapters of Computational Probability. The first chapter describes, in nonmathematical terms, the challenges in computational probability. Chapter 2 describes the methodologies available for obtaining the transition matrices for Markov chains, with particular emphasis on stochastic Petri-nets. Chapter 3 discusses how to find transient probabilities and transient rewards for these Markov chains. The next two chapters indicate how to find steady-state probabilities for Markov chains with a finite number of states. Both direct and iterative methods are described in Chapter 4. Details of these methods are given in Chapter 5. Chapters 6 and 7 deal with infinite-state Markov chains, which occur frequently in queueing, because there are times one does not want to set a bound for all queues. Chapter 8 deals with transforms, in particular Laplace transforms. The work of Ward Whitt and his collaborators, who have recently developed a number of numerical methods for Laplace transform inversions, is emphasized in this chapter. Finally, if one wants to optimize a system, one way to do the optimization is through Markov decision making, described in Chapter 9. Markov modeling has found applications in many areas, three of which are described in detail: Chapter 10 analyzes discrete-time queues, Chapter 11 describes networks of queues, and Chapter 12 deals with reliability theory.

Publish Date
Publisher
Springer US
Language
English
Pages
490

Buy this book

Previews available in: English

Edition Availability
Cover of: Computational Probability
Computational Probability
2000, Springer US
electronic resource / in English

Add another edition?

Book Details


Edition Notes

Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.

Published in
Boston, MA
Series
International Series in Operations Research & Management Science -- 24, International series in operations research & management science -- 24.

Classifications

Dewey Decimal Class
658.40301
Library of Congress
HD30.23, HD28-70HD30.23QA273., T57.6-.97

The Physical Object

Format
[electronic resource] /
Pagination
1 online resource (viii, 490 p.)
Number of pages
490

ID Numbers

Open Library
OL27025928M
Internet Archive
computationalpro00gras
ISBN 10
1441951008, 1475748280
ISBN 13
9781441951007, 9781475748284
OCLC/WorldCat
851840489

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
August 2, 2020 Edited by ImportBot import existing book
June 29, 2019 Created by MARC Bot import new book