RFC3022:Traditional IP Network Address Translator (Traditional NAT)
標(biāo)簽： Traditional Translator Address Network
上傳時間： 2014-01-17
上傳用戶：qlpqlq
RFC3027:Protocol Complications with the IP Network Address Translator
標(biāo)簽： Complications Translator Protocol Address
上傳時間： 2013-12-08
上傳用戶：athjac
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
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
