Deleting a Node of RB-Tree without recurrence
標(biāo)簽： recurrence Deleting RB-Tree without
上傳時(shí)間： 2015-05-05
上傳用戶：yuzsu
VHDL 關(guān)于2DFFT設(shè)計(jì)程序 u sciNode1 ∼ sciNode9.vhd: Every SCI Node RTL vhdl code. The details can be seen in the following section. u 2dfft.vhd: The top module includes these sciNodes and form a 3x3 SCI Torus network, and it support these sub-modules sciNode1∼ sciNode9 reset and clk and global_cnt signals to synchronous the sub-modules to simplify the overall design. u proj2.wfc: VSS simulation result that is the same as the ModelSim simulation result. u Pro2_2.wfc: VSS simulation result of another test pattern can’t cause overflow situation.
標(biāo)簽： sciNode1 sciNode details 2DFFT
上傳時(shí)間： 2014-12-02
上傳用戶：15071087253
WSN仿真一例假定節(jié)點(diǎn)0（Node[0]）周期性廣播消息其它節(jié)點(diǎn)接收到消息并轉(zhuǎn)發(fā)出去
標(biāo)簽： Node WSN 節(jié)點(diǎn) 仿真
上傳時(shí)間： 2015-07-15
上傳用戶：plsee
提出了獨(dú)立的DICOM軟件平臺(tái)的設(shè)計(jì)框架,采用了SUR-DICOM-Lib軟件實(shí)現(xiàn),并進(jìn)行了與RSNA CTN Test Node的連通性測(cè)試。
標(biāo)簽： SUR-DICOM-Lib DICOM RSNA Node
上傳時(shí)間： 2015-08-23
上傳用戶：yuzsu
nRF24E1 sample sensor Node code
標(biāo)簽： sample sensor code Node
上傳時(shí)間： 2014-09-04
上傳用戶：zhaoq123
This a two Node test, requires a Coordinator and an RFD. The coordinator and Node simply ping-pong a packet back and forth, and print out the RSSI byte. The RFD waits before bouncing it back, while the coordinator responds immediately.
標(biāo)簽： Node Coordinator coordinator and
上傳時(shí)間： 2013-12-24
上傳用戶：ardager
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
上傳時(shí)間： 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
上傳時(shí)間： 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
上傳時(shí)間： 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
上傳時(shí)間： 2013-12-28
上傳用戶：獨(dú)孤求源
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<pre id="qk820"></pre>