adhoc路由協(xié)議aodv仿真與end-to-en-delay分析
標(biāo)簽: end-to-en-delay adhoc aodv 路由協(xié)議
上傳時(shí)間: 2016-06-21
上傳用戶:tyler
采用3D Bresenham算法在兩點(diǎn)間劃一直線 % This program is ported to MATLAB from: % B.Pendleton. line3d - 3D Bresenham s (a 3D line drawing algorithm) % ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 % % Which is referenced by: % Fischer, J., A. del Rio (2004). A Fast Method for Applying Rigid % Transformations to Volume Data, WSCG2004 Conference. % http://wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf
標(biāo)簽: Bresenham Pendleton program MATLAB
上傳時(shí)間: 2013-12-10
上傳用戶:sz_hjbf
~{JGR 8vQ IzWwR5SC5D2V?bD#DbO5M3~} ~{3v?b~} ~{Hk?b~} ~{2iQ/5H9&D\~} ~{?IRTWw@)3d~} ~{TZ~}JDK1.4.2~{OBM(9}~}
上傳時(shí)間: 2015-02-22
上傳用戶:ommshaggar
This code is just a front-end to source separation algorithms.
標(biāo)簽: algorithms separation front-end source
上傳時(shí)間: 2014-01-21
上傳用戶:z754970244
用來(lái)計(jì)算混沌時(shí)間序列的延遲時(shí)間,It s applied to calculate the delay time of chaos time series,
標(biāo)簽: time calculate applied series
上傳時(shí)間: 2015-10-11
上傳用戶:songrui
symbian s60 end to end socket程序源碼 基于第二版何第三版的sdk
標(biāo)簽: end symbian socket s60
上傳時(shí)間: 2014-11-23
上傳用戶:chenjjer
The WCDMA Physical Layer Demo consists of an end-to-end (transmitter-to-receiver) simulation of the Frequency Division Duplex (FDD) Downlink physical layer for several Dedicated Channels (DCH) as specified by the 3GPP standard (Release 99).
標(biāo)簽: transmitter-to-receiver end-to-end simulation Physical
上傳時(shí)間: 2013-11-28
上傳用戶:gdgzhym
In the last three articles, I’ve been walking you through the creation of an end-to-end BlackBerry application that will serve as a mobile front-end to my Knowledge Base sample web application.
標(biāo)簽: BlackBerry end-to-end the articles
上傳時(shí)間: 2014-01-25
上傳用戶:kristycreasy
樣板 B 樹 ( B - tree ) 規(guī)則 : (1) 每個(gè)節(jié)點(diǎn)內(nèi)元素個(gè)數(shù)在 [MIN,2*MIN] 之間, 但根節(jié)點(diǎn)元素個(gè)數(shù)為 [1,2*MIN] (2) 節(jié)點(diǎn)內(nèi)元素由小排到大, 元素不重複 (3) 每個(gè)節(jié)點(diǎn)內(nèi)的指標(biāo)個(gè)數(shù)為元素個(gè)數(shù)加一 (4) 第 i 個(gè)指標(biāo)所指向的子節(jié)點(diǎn)內(nèi)的所有元素值皆小於父節(jié)點(diǎn)的第 i 個(gè)元素 (5) B 樹內(nèi)的所有末端節(jié)點(diǎn)深度一樣
上傳時(shí)間: 2017-05-14
上傳用戶:日光微瀾
歐幾里德算法:輾轉(zhuǎn)求余 原理: gcd(a,b)=gcd(b,a mod b) 當(dāng)b為0時(shí),兩數(shù)的最大公約數(shù)即為a getchar()會(huì)接受前一個(gè)scanf的回車符
標(biāo)簽: gcd getchar scanf mod
上傳時(shí)間: 2014-01-10
上傳用戶:2467478207
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1