-
RJassel_Lab1
An Artificial Neural Networks Lab
- 2010-11-14 13:15:30下载
- 积分：1
-
matlab
MATLAB黄金分割法求最小值，在区间中点的函数值作为返回值。(Golden Section Method MATLAB minimum, midpoint in the range of the function value as the return value.)
- 2010-06-23 00:13:45下载
- 积分：1
-
integration
different method of integration in computational physics
- 2014-09-17 20:42:56下载
- 积分：1
-
sensing_slot2
Writing C + + code, is to allow the use ns2 select the channel, which is our experimental multichannel implementation, hoping to share.
- 2014-01-03 11:06:50下载
- 积分：1
-
xiashan
MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<>
迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)
- 2013-05-15 08:52:09下载
- 积分：1
-
Huffmancode_r
霍夫曼编码n元编码，可以计算出平均码长，编码效率(Huffman coding n-ary coding, can calculate the average code length, coding efficiency)
- 2015-04-04 10:57:31下载
- 积分：1
-
LMS
最小均方算法的Matlab源程序,模式识别中的分类器 (Minimum mean-square algorithm Matlab source code, Pattern Recognition Classifier)
- 2008-04-22 10:15:18下载
- 积分：1
-
session2
slam进阶学习，老外做的，很完善的东西，对于同时定位与地图创建的friend有很大的帮助（第二课）(err)
- 2008-04-29 14:59:10下载
- 积分：1
-
Week06
Simple Matlab code for the 0-1 Knapsack problem: "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than a given limit and the total value is as large as possible"
- 2013-05-19 10:03:14下载
- 积分：1
-
junhenhua
对人脸的均衡化处理，效果很好，能够得到一些系数(Face of the balance of handling, well, a number of factors can be)
- 2009-05-01 10:32:01下载
- 积分：1
