登录
首页 » matlab » Kanxxx1

Kanxxx1

于 2011-04-29 发布 文件大小:1082KB
0 223
下载积分: 1 下载次数: 37

代码说明:

  有限差分法反应扩散方程捕食模型matlab程序源代码。(Finite-Difference Schemes for Reaction–Diffusion Equations Modeling Predator–Prey Interactions in MATLAB)

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

发表评论

0 个回复

  • QPSK
    说明:  QPSK详细调制解调的源码,包括整个流程.(QPSK modulation and demodulation of the source in detail, including the entire process.)
    2008-10-22 11:44:43下载
    积分:1
  • project411
    doppler effect simulation in matlab
    2013-08-14 18:36:25下载
    积分:1
  • Kalmanfilter
    数字信号处理 Digital signal processing(Digital signal processing Digital signal processing)
    2011-11-26 09:22:27下载
    积分:1
  • Super-Mario-Code
    XCODE超级玛丽,部分oc,部分c++(SuperMario,made by xcode)
    2015-03-31 12:04:34下载
    积分:1
  • matlab_perf
    一篇介绍matlab实现高效编程的文档,对于每一种方法都有相关的例子(An efficient introduction matlab programming documents, for each method are related to the case)
    2011-07-30 22:49:35下载
    积分:1
  • matrix
    在VC中用Matlab引擎计算实对称矩阵特征值和特征向量。.mor0为矩阵输入文件,.mor位结果输出文件。(Calculated using Matlab engine in the VC real symmetric matrix eigenvalues ​ ​ and eigenvectors. . Mor0 matrix input files,. Mor-bit result output file.)
    2011-09-27 15:06:37下载
    积分:1
  • block_mp
    压缩感知里面的稀疏重建问题,在原来MP的算法的基础上,提出了分块的思想,即将原子库分块后,测试算法的性能。(Compressive sensing is refered as the block sparse algorithm is described,that is based on the original MP algorithm,and the atom libruary is divided into blocks ,and the performance is testified.)
    2010-10-27 19:10:08下载
    积分:1
  • PCA
    This program is my homework of pattern recognition, it is a source code of PCA program by matlab.
    2010-11-03 16:39:40下载
    积分:1
  • TEQCmultipathmetricsinMATLAB
    说明:  用Matlab绘制TEQC结果图形的程序(The results using Matlab graphics rendering procedures TEQC)
    2009-08-01 11:42:46下载
    积分:1
  • WindyGridWorldQLearning
    Q-learning (Watkins, 1989) is a simple way for agents to learn how to act optimally in controlled Markovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successively improving its evaluations of the quality of particular actions at particular states. This paper presents and proves in detail a convergence theorem for Q,-learning based on that outlined in Watkins (1989). We show that Q-learning converges to the optimum action-values with probability 1 so long as all actions are repeatedly sampled in all states and the action-values are represented discretely. We also sketch extensions to the cases of non-discounted, but absorbing, Markov environments, and where many Q values can be changed each iteration, rather than just one.
    2013-04-19 14:23:35下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载