this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
標(biāo)簽： Traveling Salesman solution Problem
上傳時(shí)間： 2013-12-22
上傳用戶：ruixue198909
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
標(biāo)簽： Traveling Salesman solution Problem
上傳時(shí)間： 2013-12-04
上傳用戶：從此走出陰霾
Near-optimal Selection Of Transmit Antennas For A Mimo Channel Based On Shannon Capacity
標(biāo)簽： Near-optimal Selection Antennas Capacity
上傳時(shí)間： 2014-01-16
上傳用戶：稀世之寶039
Carrier-phase synchronization can be approached in a general manner by estimating the multiplicative distortion (MD) to which a baseband received signal in an RF or coherent optical transmission system is subjected. This paper presents a unified modeling and estimation of the MD in finite-alphabet digital communication systems. A simple form of MD is the camer phase exp GO) which has to be estimated and compensated for in a coherent receiver. A more general case with fading must, however, allow for amplitude as well as phase variations of the MD. We assume a state-variable model for the MD and generally obtain a nonlinear estimation problem with additional randomly-varying system parameters such as received signal power, frequency offset, and Doppler spread. An extended Kalman filter is then applied as a Near-optimal solution to the adaptive MD and channel parameter estimation problem. Examples are given to show the use and some advantages of this scheme.
標(biāo)簽： synchronization Carrier-phase multiplicativ approached
上傳時(shí)間： 2013-11-28
上傳用戶：windwolf2000
commande optimal (langue franche)
標(biāo)簽： commande optimal franche langue
上傳時(shí)間： 2014-01-24
上傳用戶：zhangjinzj
bayeserr - Computes the Bayesian risk for optimal classifier. ％ bayescln - Classifier based on Bayes decision rule for Gaussians. ％ bayesnd - Discrim. function, dichotomy, max aposteriori probability. ％ bhattach - Bhattacharya s upper limit of mean class. error. ％ pbayescln - Plots discriminat function of Bayes classifier.
標(biāo)簽： Classifier classifier bayeserr Computes
上傳時(shí)間： 2015-06-14
上傳用戶：sunjet
卡爾曼濾波C程序 卡爾曼濾波器是一個(gè)“optimal recursive data processing algorithm（最優(yōu)化自回歸數(shù)據(jù)處理算法）”。 對于解決很大部分的問題，他是最優(yōu)，效率最高甚至是最有用的。他的廣泛應(yīng)用已經(jīng)超過30年，包括機(jī)器人導(dǎo)航，控制， 傳感器數(shù)據(jù)融合甚至在軍事方面的雷達(dá)系統(tǒng)以及導(dǎo)彈追蹤等等。近年來更被應(yīng)用于計(jì)算機(jī)圖像處理， 例如頭臉識別，圖像分割，圖像邊緣檢測等等。
標(biāo)簽： processing algorithm recursive optimal
上傳時(shí)間： 2013-12-19
上傳用戶：pinksun9
卡爾曼濾波器是一個(gè)“optimal recursive data processing algorithm（最優(yōu)化自回歸數(shù)據(jù)處理算法）”。 對于解決很大部分的問題，他是最優(yōu)，效率最高甚至是最有用的。他的廣泛應(yīng)用已經(jīng)超過30年，包括機(jī)器人導(dǎo)航，控制， 傳感器數(shù)據(jù)融合甚至在軍事方面的雷達(dá)系統(tǒng)以及導(dǎo)彈追蹤等等。近年來更被應(yīng)用于計(jì)算機(jī)圖像處理， 例如頭臉識別，圖像分割，圖像邊緣檢測等等。
標(biāo)簽： processing algorithm recursive optimal
上傳時(shí)間： 2013-12-12
上傳用戶：stampede
卡爾曼濾波器是一個(gè)“optimal recursive data processing algorithm（最優(yōu)化自回歸數(shù)據(jù)處理算法）”。 對于解決很大部分的問題，他是最優(yōu)，效率最高甚至是最有用的。他的廣泛應(yīng)用已經(jīng)超過30年，包括機(jī)器人導(dǎo)航，控制， 傳感器數(shù)據(jù)融合甚至在軍事方面的雷達(dá)系統(tǒng)以及導(dǎo)彈追蹤等等。近年來更被應(yīng)用于計(jì)算機(jī)圖像處理， 例如頭臉識別，圖像分割，圖像邊緣檢測等等。
標(biāo)簽： processing algorithm recursive optimal
上傳時(shí)間： 2015-09-21
上傳用戶：baiom
Build an optimal binary search tree using dynamic programming.
標(biāo)簽： programming optimal dynamic binary
上傳時(shí)間： 2013-12-25
上傳用戶：dengzb84
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
