problem of blind demodulation of multiuser information symbols in a high-rate code-division multiple-access (CDMA) network in the presence of both multiple-access interference (MAI) and intersymbol interference (ISI) is considered.
標(biāo)簽： code-division demodulation information multiuser
上傳時(shí)間： 2014-01-13
上傳用戶(hù)：熊少鋒
The design is transformed into a wiener filtering problem and the parameters are modeled as correlated ARIMA processes with known dynamics.
標(biāo)簽： transformed parameters filtering correlat
上傳時(shí)間： 2014-12-06
上傳用戶(hù)：ardager
algorithm bfs to solve knight tour problem
標(biāo)簽： algorithm problem knight solve
上傳時(shí)間： 2013-12-23
上傳用戶(hù)：qwe1234
Rough sets algorithms in classification problem
標(biāo)簽： classification algorithms problem Rough
上傳時(shí)間： 2017-07-24
上傳用戶(hù)：yzy6007
skyline method. for solving [K]{x}={F}
標(biāo)簽： skyline solving method for
上傳時(shí)間： 2013-12-17
上傳用戶(hù)：asdkin
solving the equation
標(biāo)簽： equation solving the
上傳時(shí)間： 2017-07-24
上傳用戶(hù)：123456wh
The program simulate an 8 Queen mathematical problem
標(biāo)簽： mathematical simulate program problem
上傳時(shí)間： 2017-07-24
上傳用戶(hù)：asdfasdfd
FERRET - a broadcast analysis tool This tool is designed to demonstrate the problem of "data seapage". The average machine broadcasts a lot of information about itself on open networks. This tool captures and organizes this information. This code is extremely low quality, hacked together in order to demonstrate the problem at the BlackHat Federal 2007 conference. Higher quality code should be available around May 2007 on our website at http://www.erratasec.com.
標(biāo)簽： tool demonstrate broadcast analysis
上傳時(shí)間： 2013-11-30
上傳用戶(hù)：1101055045
多旅行商問(wèn)題(Multiple Traveling Salesperson Problem ,簡(jiǎn)稱(chēng)MTSP) 討論的是如何安排m( > 1 ) 位旅行商訪問(wèn)n( > m ) 座城市,要求每個(gè)城市只允許被訪問(wèn)一次時(shí),求解所有旅行商花費(fèi)的費(fèi)用和是最小(或最大) 的問(wèn)題。MTSP 問(wèn)題其實(shí)與單 旅行商問(wèn)題(Traveling Salesperson Problem ,簡(jiǎn)稱(chēng)TSP) 相似,但是由于添加了任何城市只要被某一旅行商訪問(wèn)到即可這個(gè)附加條 件,因而增加了問(wèn)題復(fù)雜度。在以前使用遺傳算法(GA) 研究解決MTSP 問(wèn)題時(shí),通常采用標(biāo)準(zhǔn)的TSP 染色體和處理方法?，F(xiàn) 為解決MTSP 問(wèn)題給出了一種新的染色體設(shè)計(jì)和相關(guān)的處理方法,并與以往的理論設(shè)計(jì)和計(jì)算性能進(jìn)行比較。計(jì)算測(cè)試顯 示,新的方法能夠獲得較小的查找空間,在許多方面,新的方法產(chǎn)生的解空間更好。
標(biāo)簽： Salesperson Traveling Multiple Problem
上傳時(shí)間： 2013-12-17
上傳用戶(hù)：蟲(chóng)蟲(chóng)蟲(chóng)蟲(chóng)蟲(chóng)蟲(chóng)
MTSP 問(wèn)題其實(shí)與單 旅行商問(wèn)題(Traveling Salesperson Problem ,簡(jiǎn)稱(chēng)TSP) 相似,但是由于添加了任何城市只要被某一旅行商訪問(wèn)到即可這個(gè)附加條 件,因而增加了問(wèn)題復(fù)雜度。在以前使用遺傳算法(GA) 研究解決MTSP 問(wèn)題時(shí),通常采用標(biāo)準(zhǔn)的TSP 染色體和處理方法。
標(biāo)簽： Salesperson Traveling Problem MTSP
上傳時(shí)間： 2013-12-24
上傳用戶(hù)：731140412
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
