|
|
[資源]
【英美最新教材】《Markov Chains: Theory and Applications》【已搜索,無重復(fù)】
【英美最新教材】《Markov Chains: Theory and Applications》【已搜索,無重復(fù)】
我的這本書:
作者:Bruno Sericola
2013年,416 頁,PDF,3 MB。
Language: English
.
封面:
。
![【英美最新教材】《Markov Chains: Theory and Applications》【已搜索,無重復(fù)】]()
。
簡介:
Markov chains are a fundamental class of stochastic processes. They are widely used to solve problems in a large number of domains such as operational research, computer science, communication networks and manufacturing systems.
The success of Markov chains is mainly due to their simplicity of use, the large number of available theoretical results and the quality of algorithms developed for the numerical evaluation of many metrics of interest.
The author presents the theory of both discrete-time and continuous-time homogeneous Markov chains. He carefully examines the explosion phenomenon, the Kolmogorov equations, the convergence to equilibrium and the passage time distributions to a state and to a subset of states. These results are applied to birth-and-death processes. He then proposes a detailed study of the uniformization technique by means of Banach algebra. This technique is used for the transient analysis of several queuing systems.
Contents
1. Discrete-Time Markov Chains
2. Continuous-Time Markov Chains
3. Birth-and-Death Processes
4. Uniformization
5. Queues
About the Authors
Bruno Sericola is a Senior Research Scientist at Inria Rennes – Bretagne Atlantique in France. His main research activity is in performance evaluation of computer and communication systems, dependability analysis of fault-tolerant systems and stochastic models.
==========================================
敬請各位朋友,下載之后,給個回帖評價。我也好繼續(xù)推出下一個最新科技書籍。
(不下載,也可以評價。)
謝謝! |
» 本帖附件資源列表
-
歡迎監(jiān)督和反饋:小木蟲僅提供交流平臺,不對該內(nèi)容負(fù)責(zé)。
本內(nèi)容由用戶自主發(fā)布,如果其內(nèi)容涉及到知識產(chǎn)權(quán)問題,其責(zé)任在于用戶本人,如對版權(quán)有異議,請聯(lián)系郵箱:xiaomuchong@tal.com
- 附件 1 : Markov_Chains_Theory_and_Applications_2013.pdf
2014-06-24 20:35:33, 2.65 M
» 收錄本帖的淘帖專輯推薦
» 猜你喜歡
» 本主題相關(guān)價值貼推薦,對您同樣有幫助:
|