登录
首页 » matlab » lms

lms

于 2009-05-17 发布 文件大小:1KB
0 277
下载积分: 1 下载次数: 28

代码说明:

  神经网络中lms算法的matlab实现和在分类中的应用(Lms of neural network algorithm matlab realization and application in the classification)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • pengolahan-citra-matlab
    Image Processing using Matlab
    2010-06-25 13:52:40下载
    积分:1
  • matlab
    三维图形matlab实现,说明了个函数的用法,给出了结果(picture drawed by matlab)
    2009-11-18 19:35:22下载
    积分:1
  • chepaishibie
    车牌识别算法。包括图像预处理、车牌分割、字符分割(License plate recognition algorithm. Including image preprocessing, license plate segmentation, character segmentation and character recognition)
    2013-10-30 22:00:04下载
    积分:1
  • DifFUZZY-1.1
    Recognize the role of the grid and the limits of DG. Grid investment and innovation must be supported
    2012-01-20 19:56:18下载
    积分:1
  • matlab_help
    matlab中文文档帮助,适用于matlab初学者(Matlab help Chinese document, suitable for beginners matlab)
    2014-12-05 10:10:12下载
    积分:1
  • MIT6_094IAP10_assn03.pdf
    麻省理工学院introduction to matlab课程作业指导(3),包含matlab实例,相互交流(same excellent matlab exercises homework for improving matlab )
    2015-01-15 15:25:49下载
    积分:1
  • Gsapvitessevariable2
    la machine gsap avec vitesse var
    2019-04-21 19:13:40下载
    积分:1
  • qdr-paper
    基于四叉树与图割的遥感图像分割方法,关于四叉树和图割的应用(Quadtree-based remote sensing image and graph cuts segmentation method, on the quad tree and the application of graph cuts)
    2011-01-17 15:34:36下载
    积分:1
  • endpoint-detect
    说明:  检测语音信号起始点和终止点,用于音频传输(endpoint detect)
    2011-03-18 21:50:17下载
    积分:1
  • 0-1programming
    0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。另:胡运权所著的《运筹学基础及应用(第三版)》第97页的例3,我用本程序求解得到的结果是:最优解是x*=(1,0, 0, 0, 0),最优值是f(x*)=8,但书求得最优解是x*=(1,0, 1, 0, 0),最优值是f(x*)=4,是不是书中写错了,请大家验证。以下是源程序,大家可以任意使用无版权问题,另外,如果大家有大规模的0-1规划的问题也希望提供给我,谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
    2006-07-01 10:33:18下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载