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.
標(biāo)簽： 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.
標(biāo)簽： 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.
標(biāo)簽： capacities stochastic addresses network
上傳時間： 2014-01-09
上傳用戶：二驅(qū)蚊器
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.
標(biāo)簽： 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.
標(biāo)簽： binary-state reliability probability network
上傳時間： 2015-12-04
上傳用戶：xcy122677
經(jīng)典的BP neural network 算法
上傳時間： 2013-12-14
上傳用戶：zycidjl
經(jīng)典的SOM Neural Network 算法
標(biāo)簽： Network Neural SOM 算法
上傳時間： 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.
標(biāo)簽： nodes stochastic-flow including consists
上傳時間： 2013-12-22
上傳用戶：wlcaption
“網(wǎng)絡(luò)基本輸入／輸出系統(tǒng)”（Network Basic Input/Output System, NetBIOS）是一種標(biāo)準(zhǔn)的應(yīng)用程序編程接口（ A P I），1 9 8 3年由S y t e k公司專為I B M開發(fā)成功)
標(biāo)簽： Network NetBIOS Output System
上傳時間： 2015-12-09
上傳用戶：wanghui2438
關(guān)于UTRAN(Universal Terrestrial Radio Access Network 通用陸地?zé)o線接入網(wǎng)絡(luò))的全面描述. 對UTRAN的結(jié)構(gòu),協(xié)議層,操作&管理要求等詳細(xì)描述,學(xué)習(xí)TD的好材料
標(biāo)簽： UTRAN Terrestrial Universal Network
上傳時間： 2014-02-09
上傳用戶：dave520l
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
