-
PSO
梯度下降法是最早最简单，也是最为常用的最优化方法。梯度下降法实现简单，当目标函数是凸函数时，梯度下降法的解是全局解。一般情况下，其解不保证是全局最优解，梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向，因为该方向为当前位置的最快下降方向，所以也被称为是”最速下降法“。最速下降法越接近目标值，步长越小，前进越慢。(The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.)
- 2018-01-29 21:44:10下载
- 积分：1
-
Parallel_Port_Complete_Programming-_Interfacing_a
Complete Parallel Port Development. Covers all PP standards.
- 2014-01-28 20:21:15下载
- 积分：1
-
SVDBasedImageQualityMeasure
Source code svd in matlab
- 2009-11-12 22:42:40下载
- 积分：1
-
industrial-strength
eBook - Industrial Strength C++ - Visual C++ guide
- 2014-02-02 13:03:09下载
- 积分：1
-
Gauss-Laguerre
matlab勒让德 - 高斯求积,用于计算勒让德 - 高斯求积分(Gauss–Laguerre quadrature)
- 2015-02-17 14:43:58下载
- 积分：1
-
CalFeature
双目视觉测距用到的程序，对图像中点相同点聚类用的(Ranging procedures used binocular vision, the image clustering using the midpoint of the same point)
- 2009-09-07 09:45:18下载
- 积分：1
-
ex_kaiser
kaiser窗函数的用法，这是一个资料上的，经过验证了，希望帮得到你。(usage of the kaiser window function, which is an information, after the verification, and hope to help get you.)
- 2012-06-15 10:51:40下载
- 积分：1
-
malat
基于MFC编写的界面，用VC与matlab混编实现马拉特小波分解，有文档注释，适合初学者(
MFC-based interface prepared by VC and matlab mixed to achieve Marat wavelet decomposition, documentation notes, suitable for beginners)
- 2013-12-05 09:40:36下载
- 积分：1
-
Matlab--one-hundred-cases
Matlab 实用程序百例，对初学者很有用，推荐下载。(Matlab utility, one hundred cases, very useful for beginners, recommended download.)
- 2011-10-23 16:50:41下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
