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...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Croatian Operational Research Society
2016-04-01
|
| Saila: | Croatian Operational Research Review |
| Gaiak: | |
| Sarrera elektronikoa: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=231896 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|