登录
首页 » matlab » LSL

LSL

于 2009-06-26 发布 文件大小:1KB
0 167
下载积分: 1 下载次数: 11

代码说明:

  最小均方算法lms源程序,算法简单,实用,可准确无误的运行(Minimum mean-square source lms algorithm, the algorithm is simple, practical, accurate operation can be)

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

发表评论

0 个回复

  • decoupling_pole
    解耦控制要求下的极点配置MATLAB算法。 关键词:解耦控制 极点配置 线性系统 MATLAB(A matlab algorithm of arbitrary pole- assignment in the sense of decoupli countrol)
    2011-05-11 15:58:36下载
    积分:1
  • matlab
    logistic混沌产生过程,产生周期解的过程。(logistic chaos generation process, generating process of periodic solutions.)
    2013-11-27 22:26:53下载
    积分:1
  • SOM_NN_CODE
    An important aspect of an ANN model is whether it needs guidance in learning or not. Based on the way they learn, all artificial neural networks can be divided into two learning categories - supervised and unsupervised. • In supervised learning, a desired output result for each input vector is required when the network is trained. An ANN of the supervised learning type, such as the multi-layer perceptron, uses the target result to guide the formation of the neural parameters. It is thus possible to make the neural network learn the behavior of the process under study. • In unsupervised learning, the training of the network is entirely data-driven and no target results for the input data vectors are provided. An ANN of the unsupervised learning type, such as the self-organizing map, can be used for clustering the input data and find features inherent to the problem.
    2015-04-15 00:03:32下载
    积分:1
  • hckj
    合成孔径数据处理系统完整描述,RD算法和CS算法(Data Processing System Synthetic Aperture complete description, RD algorithm and the CS algorithm)
    2009-05-18 10:47:27下载
    积分:1
  • SVMLS_v0
    defective image finding
    2013-03-16 12:33:53下载
    积分:1
  • Desktop
    最大流问题,一种组合最优化问题,就是要讨论如何充分利用装置的能力,使得运输的流量最大,以取得最好的效果。求最大流的标号算法最早由福特和福克逊于1956年提出,20世纪50年代福特、福克逊建立的“网络流理论”,是网络应用的重要组成成分。(Maximum flow problem, a combinatorial optimization problem, is to discuss how to make full use of the capacity of the device to maximize the flow of transport in order to achieve the best results. The labeling algorithm for maximum flow was first proposed by Ford and Fulkerson in 1956. The network flow theory established by Ford and Fulkerson in 1950s is an important component of network application.)
    2019-06-28 10:29:03下载
    积分:1
  • Topological_derivative_Segmentation
    Topological derivative Segmentation
    2012-04-03 06:59:09下载
    积分:1
  • thesis22
    variable frequency derive
    2014-09-16 12:58:01下载
    积分:1
  • star
    It is A* Search in AI
    2010-05-16 00:25:19下载
    积分:1
  • Vehicular-Networks-From-Theory-To-Practice
    Vehicular Networks From Theory to Practice .. It is a full book for STEPHAN OLARIU and MICHELE C. WEIGLE .. 2009 .. CRC Press
    2015-02-07 13:07:13下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载