טוען...
The shortest path problem in the stochastic networks with unstable topology
The stochastic shortest path length is defined as the arrival probability from a given source node to a given destination node in the stochastic networks. We consider the topological changes and their effects on the arrival probability in directed acyclic networks. There is a stable topology which s...
שמור ב:
| הוצא לאור ב: | Springerplus |
|---|---|
| Main Authors: | , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Springer International Publishing
2016
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5020038/ https://ncbi.nlm.nih.gov/pubmed/27652102 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s40064-016-3180-7 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|