登录
首页 » matlab » xinhao

xinhao

于 2014-12-26 发布 文件大小:9KB
0 237
下载积分: 1 下载次数: 4

代码说明:

  信号模型,可以对初学者有很大帮助。简单的运行,让你懂得搭建模型的基本原理。(The signal model, can be of great help for beginners. Simple operation, let you understand the basic principles of building model.)

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

发表评论

0 个回复

  • ESN
    在matlab环境下,实现了回声状态网络的训练、测试功能(The methods described for training ESNs are described in detail)
    2020-11-09 22:39:47下载
    积分:1
  • cc
    说明:  改进神经元自适应的pid控制,采用本算法,全系数的在线修正就不完全是根据神经网络学习原理,而是参考实际经验制定的(Improve the neuron adaptive pid control, the use of the algorithm, the coefficient of online correction is not completely according to the principle of neural network learning, but refer to the practical experience)
    2014-08-21 20:15:05下载
    积分:1
  • 48567941lms_algo
    说明:  信道预测方法中的LMS方法,用来进行信道预测(LMS method in channel prediction method for channel prediction)
    2019-02-18 13:53:01下载
    积分:1
  • chen
    本程序画混沌的Chen系统,程序简单切运算速度快.(This procedure painting chaotic Chen system, the program simply cut operation is fast.)
    2011-07-24 23:58:42下载
    积分:1
  • shipingenzong
    侦查法实现视频跟踪的matlab源代码 (Investigation of video tracking matlab source code)
    2012-09-05 18:16:08下载
    积分:1
  • Freitas-RRBPF-Paper
    Nando de Freitas 编写的RBPF 程序对应的论文(Nando de Freitas-RBPF-Paper)
    2014-12-17 11:11:40下载
    积分:1
  • mmc1
    用于地球物理中重力和磁力位场边界提取的几个常用的算法,包含数据处理,建模,和滤波。(Gravity and Magnetic Data Mapping, Processing, Modeling and Filtering Software.)
    2014-01-08 13:22:34下载
    积分:1
  • Code-Final
    QPSK Modulation Demodulation, BER vs SNR plot
    2014-02-17 21:24:59下载
    积分:1
  • dace
    说明:  克里金代理模型的DACE工具箱,可用于优化计算(The dace toolbox of Kriging agent model can be used for optimization calculation)
    2020-10-11 16:03:20下载
    积分:1
  • TSP
    利用遗传算法求解旅行商问题 旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 (Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.)
    2010-05-20 23:00:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载