The critical node problem in stochastic networks with discrete-time Markov chain
The length of the stochastic shortest path is defined as the arrival probability from a source node to a destination node. The uncertainty of the network topology causes unstable connections between nodes. A discrete-time Markov chain is devised according to the uniform distribution of existing arcs...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Croatian Operational Research Society
2016-04-01
|
| Edice: | Croatian Operational Research Review |
| Témata: | |
| On-line přístup: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=231896 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|