-
test1
递归实现一个集合的所有的子集的输出。
例如{1，2}
输出{}{1}{2}{1，2}(A subset of the output of recursion)
- 2010-01-10 00:16:28下载
- 积分：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
-
Exercise04
4th exercise of computer graphics course
- 2014-11-22 23:54:40下载
- 积分：1
-
TSP
说明： 介绍求解TSP 问题的蚁群算法，是解决旅行售货员问题的一种比较好的方法(Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to)
- 2009-08-21 09:57:16下载
- 积分：1
-
float-digtal
关于数据转换的很好的C语言程序，很好用，很实用(Data conversion on the C language program good, very good, very practical)
- 2011-09-02 21:18:49下载
- 积分：1
-
randomlib
random library by mustiere
- 2010-12-22 15:14:06下载
- 积分：1
-
amtf
matlab仿真源代码，AM源程序，用matlab运行(matlab simulation source code, AM source, using matlab to run)
- 2008-05-20 16:42:42下载
- 积分：1
-
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
-
DegreeOfPolarisation
球形粒子Mie 散射用Matlab编写的Mie theory计算程序(Mie scattering of spherical particles with a Matlab computer program written in Mie theory)
- 2010-10-05 10:50:06下载
- 积分：1
-
m_series
用移位寄存器产生M序列的MATLAB软件实现(M generated using shift register sequences MATLAB software)
- 2008-03-14 19:00:45下载
- 积分：1
