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
The MATLAB coding style, project options and synthesis directives can have a significant effect on the final results. Knowledge about how a particular algorithm should be implemented in hardware can be reflected in the MATLAB code to improve the results. In doing so, the MATLAB loses a bit of its abstraction but the lower-level MATLAB will infer the desired architecture into the device.
標簽： significant directives synthesis project
上傳時間： 2013-12-03
上傳用戶：13517191407
QccPackSPIHT-0.54-1 (release 2007-04-30) The Set Partitioning in Hierarchical Trees (SPIHT) algorithm for wavelet-based image coding .
標簽： QccPackSPIHT Partitioning Hierarchical release
上傳時間： 2014-02-15
上傳用戶：lacsx
％this program is written by 劉學智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating stealing algorithm
標簽： utilizing Finished program problem
上傳時間： 2015-10-07
上傳用戶：yimoney
％this program is written by 劉學智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating stealing algorithm
標簽： utilizing Finished program problem
上傳時間： 2015-10-07
上傳用戶：cc1915
％this program is written by 劉學智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating stealing algorithm
標簽： utilizing Finished program problem
上傳時間： 2014-01-24
上傳用戶：遠遠ssad
A .NET Path Finder Library Path Finder Library is a .NET library that currently contains one type called SimplePathFinder. SimplePathFinder is a very simple and basic implementation of the A* path finding algorithm. It is extremely easy to use and integrate in your applications. It works very well and I hope you enjoy using it. 這是一個用C#實現的路徑搜索算法，實現的了簡單的A*算法！
上傳時間： 2013-12-14
上傳用戶：hullow
A general technique for the recovery of signi cant image features is presented. The technique is based on the mean shift algorithm, a simple nonparametric pro- cedure for estimating density gradients. Drawbacks of the current methods (including robust clustering) are avoided. Feature space of any nature can be processed, and as an example, color image segmentation is dis- cussed. The segmentation is completely autonomous, only its class is chosen by the user. Thus, the same program can produce a high quality edge image, or pro- vide, by extracting all the signi cant colors, a prepro- cessor for content-based query systems. A 512 512 color image is analyzed in less than 10 seconds on a standard workstation. Gray level images are handled as color images having only the lightness coordinate
標簽： technique presented features recovery
上傳時間： 2015-10-14
上傳用戶：410805624
By building a nonlinear function relationship between an d the error signal，this paper presents a no— vel variable step size LMS(Least Mean Square)adaptive filtering algorithm．
標簽： relationship nonlinear building function
上傳時間： 2015-10-22
上傳用戶：hzy5825468
Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.
標簽： representation Magnitude the magnitude
上傳時間： 2013-12-24
上傳用戶：金宜
<strike id="8ymc8"></strike>