-
Method2
Matlab程序用作混沌时间序列的预测。
(Matlab program used for chaotic time series prediction.)
- 2008-03-27 14:52:09下载
- 积分：1
-
bezier
a gui for bezier curve for n points
- 2014-11-21 01:28:48下载
- 积分：1
-
rgb2hsv_fast
In addition to being inherently more efficient, it introduces optional arguments
- to calculate in single precision
- to calculate only hue or saturation
or value (or combinations of them)
- 2007-10-23 08:36:59下载
- 积分：1
-
thinmatlab
图像的thin代码，用MATLAB实现，简单易用.(Images of thin code, use MATLAB to achieve, easy to use.)
- 2007-12-13 16:52:00下载
- 积分：1
-
p_judge
判断一组数据服从何种分布：正态分布判，断泊松分布判断，γ分布判断，指数分布判断，rayleigh分布判断(Determine a set of data obey what distribution
)
- 2013-08-25 09:13:28下载
- 积分：1
-
sinuous
正弦函数与余弦函数的线性组合
变精度数是用确切的有理表示存在的一个小数点。利用变精度而合理的算法，创建变量使用vpa功能。(This example feedforward utilization 2/3 convolutional encoder drawing. Describes how to determine the coded block parameters. This example also illustrates the use of the calculation error block reception delay.)
- 2012-11-30 20:35:15下载
- 积分：1
-
DMC
动态矩阵控制DMC的一个很好的matlab程序,可以应用到很多的领域(a program of dynamic matrix conrol using matlab)
- 2009-12-22 11:10:59下载
- 积分：1
-
DeMat
微分进化算法matlab程序代码，可直接运行，给研究微分进化算法的朋友提供帮助(Differential evolution algorithm)
- 2012-05-08 14:04:30下载
- 积分：1
-
cornerfinder
关于棋盘格的角点提取，用MATLAB编写的(Checkerboard on the corner extraction, prepared by using MATLAB)
- 2007-05-05 00:46:18下载
- 积分：1
-
tsp
蕞优分组周游路线问题是一类物流智能调度问题，是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后，人们对这一类问题给予了极大的关注并进行了大量的研究，提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大，纯数学方法在允许的时间和空间上都很难找到问题的最优解，于是人们开始转向寻找问题的近似最优解，遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效，但对于有多个限制条件的多目标最优化问题缺显得有点力不从心，很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法，虽然建模条件限制了描述的问题的通用性，有待推广，但它能有效利用问题的领域知识，提高了求解效率，保证了解的可行性和最优性，算法思想极具推广潜力，可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)
- 2014-08-18 10:05:55下载
- 积分：1
