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
标签： Traveling Salesman solution Problem
上传时间： 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)
标签： Traveling Salesman solution Problem
上传时间： 2013-12-04
上传用户：从此走出阴霾
Near-Optimal Selection Of Transmit Antennas For A Mimo Channel Based On Shannon Capacity
标签： Near-Optimal Selection Antennas Capacity
上传时间： 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.
标签： synchronization Carrier-phase multiplicativ approached
上传时间： 2013-11-28
上传用户：windwolf2000
commande optimal (langue franche)
标签： commande optimal franche langue
上传时间： 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.
标签： Classifier classifier bayeserr Computes
上传时间： 2015-06-14
上传用户：sunjet
卡尔曼滤波C程序 卡尔曼滤波器是一个“optimal recursive data processing algorithm（最优化自回归数据处理算法）”。 对于解决很大部分的问题，他是最优，效率最高甚至是最有用的。他的广泛应用已经超过30年，包括机器人导航，控制， 传感器数据融合甚至在军事方面的雷达系统以及导弹追踪等等。近年来更被应用于计算机图像处理， 例如头脸识别，图像分割，图像边缘检测等等。
标签： processing algorithm recursive optimal
上传时间： 2013-12-19
上传用户：pinksun9
卡尔曼滤波器是一个“optimal recursive data processing algorithm（最优化自回归数据处理算法）”。 对于解决很大部分的问题，他是最优，效率最高甚至是最有用的。他的广泛应用已经超过30年，包括机器人导航，控制， 传感器数据融合甚至在军事方面的雷达系统以及导弹追踪等等。近年来更被应用于计算机图像处理， 例如头脸识别，图像分割，图像边缘检测等等。
标签： processing algorithm recursive optimal
上传时间： 2013-12-12
上传用户：stampede
卡尔曼滤波器是一个“optimal recursive data processing algorithm（最优化自回归数据处理算法）”。 对于解决很大部分的问题，他是最优，效率最高甚至是最有用的。他的广泛应用已经超过30年，包括机器人导航，控制， 传感器数据融合甚至在军事方面的雷达系统以及导弹追踪等等。近年来更被应用于计算机图像处理， 例如头脸识别，图像分割，图像边缘检测等等。
标签： processing algorithm recursive optimal
上传时间： 2015-09-21
上传用户：baiom
Build an optimal binary search tree using dynamic programming.
标签： programming optimal dynamic binary
上传时间： 2013-12-25
上传用户：dengzb84
