登录
首页 » matlab » OLS-rbf

OLS-rbf

于 2012-10-02 发布 文件大小:1KB
0 247
下载积分: 1 下载次数: 15

代码说明:

  OLS rbt neural network BP

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

发表评论

0 个回复

  • DFT
    离散傅里叶变换的程序,可以画出原图和频谱(Discrete Fourier Transform process)
    2009-05-24 13:51:50下载
    积分:1
  • matlab-function
    MATLAB中的大部分函数都有说明十分有用,对于学习MATLAB的人来说如获至宝(Most MATLAB functions have explained very useful for people who are highly prized learning MATLAB)
    2014-08-09 09:40:06下载
    积分:1
  • timing_syn
    OFDM Timing Synchronization。OFDM时域同步matlab源代码.(OFDM Timing Synchronization. OFDM time-domain synchronous matlab source code.)
    2008-05-15 14:00:30下载
    积分:1
  • tamrin6dipolefeed0.33l
    this file contains the matlab codes that calculate dipole antenna characteristics in different wavelength.
    2013-01-09 17:15:07下载
    积分:1
  • Xampling
    xampling compressive sensing
    2013-10-18 00:15:54下载
    积分:1
  • cyclic2
    完整的循环谱计算代码,可以直接运用,稍加改动就可以变成其他的循环谱形式,欢迎下载。(Complete cycle spectrum calculation code can be directly applied, a little change can become another form of cyclic spectrum, welcome to download.)
    2014-07-12 21:02:38下载
    积分:1
  • lvbo
    基于matlab的值中值滤波程序,几种滤波模板的比较(Value based on median filter matlab program, the comparison of several filter templates)
    2011-06-12 17:01:58下载
    积分:1
  • DSB_SC_modulation
    this is the simulink block diagram for the DSB-SC "double side band suppress carrier"
    2013-11-17 02:37:35下载
    积分:1
  • SC_FDE
    本论文主要围绕单载波频域均衡技术展开。首先阐述了无线信道的基本特性,引出了应用均衡技术的必要性。(This thesis focus on a single carrier frequency domain equalization started. First described the basic characteristics of wireless channel, leads to the need for the application of equalization.)
    2010-11-26 12:54:49下载
    积分:1
  • 5
    说明:  利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
    2011-05-10 16:03:58下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载