-
matlab_GA
说明： 遗传算法，matlab实现。包含一整套源码(Genetic algorithm, matlab implementation)
- 2009-08-28 09:09:28下载
- 积分：1
-
mras
This is the file for model reference adaptive system.
- 2013-02-23 20:20:08下载
- 积分：1
-
scream_v1
用Matlab编写的多元回归工具箱，主要用于多为数组的分析，例如平行因子分析（Parafac ananysis）(SCREAM: A novel method for multi-way regression problems with shifts and shape changes in one mode.)
- 2014-10-24 16:30:07下载
- 积分：1
-
duffingfencha
duffing分岔程序，用于求解微分方程的分岔，研究稳定性(duffing bifurcation procedure for solving differential equations of the bifurcation of stability)
- 2010-08-20 20:53:11下载
- 积分：1
-
conv
数字信号处理，现行卷积的matlab代码，和函数文件。(Digital signal processing, the current convolution matlab code, and function files.)
- 2012-11-06 19:36:05下载
- 积分：1
-
ekf
this program describes the extended kalman filter
- 2012-02-14 11:19:23下载
- 积分：1
-
SGAPublic
本SGA可以优化变量，求最小值,最大值（当把函数倒数也就求最小值啦）
并且支持浮点编码，grey编码，二进制编码；轮赌法选择，锦标赛选择；单点交叉，均布交叉，浮点交叉；
单点变异，浮点变异；(The SGA can optimize the variables, find minimum, maximum (when the function is also seeking the minimum reciprocal friends) and support for floating-point encoding, grey code, binary code roulette method selection, tournament selection single point crossover, uniform Cross, floating-point crossover single point mutation, floating-point mutation )
- 2010-08-25 12:58:41下载
- 积分：1
-
Gui_scripter
matlab与VB接口的例子，老外写的，很详细(VB interface with matlab example, written by a foreigner, in great detail)
- 2009-05-08 18:23:45下载
- 积分：1
-
example-for-svm
说明： 支持向量机程序使用实例：通过实例演示怎样使用支持向量机(Support vector machine uses examples: an example how to use the support vector machine)
- 2011-02-18 20:40:45下载
- 积分：1
-
TSP
旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)
- 2015-01-18 21:43:12下载
- 积分：1
