-
matlab-help
matlab软件的中文帮助，方便英语水平不精的可以方便的学习matlab软件(matlab software for English to help facilitate the standard of English can be ill-equipped to facilitate the study matlab software)
- 2009-03-17 10:17:43下载
- 积分：1
-
caidai
本程序是用processing软件编写的鼠标互动程序，通过移动鼠标可出现有趣动画(The program is written in the mouse interaction processing software program, by moving the mouse, there may be interesting animation)
- 2010-12-23 20:10:25下载
- 积分：1
-
sf
灰色关联度算法，灰色系统分析方法针对不同问题性质有几种不同做法，灰色关联度分析(GreyRelationalAnalysis)是其中的一种(Grey algorithm, gray system analysis methods for different nature of the problem there are several different approaches, gray correlation analysis (GreyRelationalAnalysis) is one of them)
- 2013-08-25 20:02:47下载
- 积分：1
-
dijkstra3-Structured-Method
一种建立基于蚁群算法的路径规划空间模型的算法，使用与链接法，不适用于栅格法。(An algorithm based on the establishment, use and links to law ant colony algorithm path planning space model, does not apply to the grid method.)
- 2020-10-26 15:29:59下载
- 积分：1
-
20160428-1
基于频率切片小波变换预处理，此方法适用于盲信号分离的预处理，方法有很多优点。(Based on the frequency slice wavelet transform preconditioning, this method is suitable for the pretreatment of blind signal separation, the method has many advantages.)
- 2021-04-27 10:18:44下载
- 积分：1
-
GARCH
对GARCH－t模型参数的估计,主要是运用已有的股票数据估计参数(GARCH-t model for the estimated parameters, mainly the use of stock data has been estimated parameters)
- 2007-12-26 18:21:55下载
- 积分：1
-
WingerVille
能够非常清楚的看出幅值和时间的变化规律，不用再画时、频图(Can very clear indication of the amplitude and the change of time rule，Don t draw, frequency chart)
- 2012-03-22 16:33:09下载
- 积分：1
-
moead_cec2009_2011version
多目标最优化moea算法老版本，带C++源码！(The multiobjective optimization moea algorithm old version, with C++ source!)
- 2013-03-02 23:36:58下载
- 积分：1
-
analysis
用matlab对离散系统的时域分析，得到其特性曲线(Using matlab for time-domain analysis of discrete systems, by their characteristic)
- 2011-07-08 22:20:26下载
- 积分：1
-
ACA_TSP
旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm
to work out the TSP.)
- 2013-09-19 22:37:38下载
- 积分：1
