This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2015-12-03
上傳用戶：xfbs821
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2013-12-25
上傳用戶：ggwz258
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2014-01-09
上傳用戶：二驅蚊器
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2013-12-28
上傳用戶：獨孤求源
Each arc of a binary-state network has good/bad states. The system reliability, the probability that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is different from the so-called minimum path. The latter is a path with minimum cost.
標簽： binary-state reliability probability network
上傳時間： 2015-12-04
上傳用戶：xcy122677
經典的BP neural network 算法
上傳時間： 2013-12-14
上傳用戶：zycidjl
經典的SOM Neural Network 算法
上傳時間： 2015-12-04
上傳用戶：hgy9473
A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple operational states.
標簽： nodes stochastic-flow including consists
上傳時間： 2013-12-22
上傳用戶：wlcaption
“網絡基本輸入／輸出系統”（Network Basic Input/Output System, NetBIOS）是一種標準的應用程序編程接口（ A P I），1 9 8 3年由S y t e k公司專為I B M開發成功)
標簽： Network NetBIOS Output System
上傳時間： 2015-12-09
上傳用戶：wanghui2438
關于UTRAN(Universal Terrestrial Radio Access Network 通用陸地無線接入網絡)的全面描述. 對UTRAN的結構,協議層,操作&管理要求等詳細描述,學習TD的好材料
標簽： UTRAN Terrestrial Universal Network
上傳時間： 2014-02-09
上傳用戶：dave520l
