N+M容错
N+M容错技术资料下载专区,收录500份相关技术文档、开发源码、电路图纸等优质工程师资源,全部免费下载。
N+M容错 全部资料 500 份
/* author: qiaoger email: qiaoger@tom.com date: 2008-1-7 question: 求 n! (n<=5000) */
/* author: qiaoger email: qiaoger@tom.com date: 2008-1-7 question: 求 n! (n<=5000) */
2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input
2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive intege...
产生一512点的随机序列下Xe(n),并用Xc(n) 和Xe(n) 作线性卷积
产生一512点的随机序列下Xe(n),并用Xc(n) 和Xe(n) 作线性卷积,观察卷积前后Xe(n) 频谱的变化。要求将Xe(n)分成8段,采用重叠相加法。
产生一512点的随机序列下Xe(n),并用Xc(n) 和Xe(n) 作线性卷积
产生一512点的随机序列下Xe(n),并用Xc(n) 和Xe(n) 作线性卷积,观察卷积前后Xe(n) 频谱的变化。要求将Xe(n)分成8段,采用重叠保留法。
利用RLS算法实现参数的自适应估计 估计y(n) = 1.5*y(n-1)-0.7*y(n-2)+0.3*u(n-2)中的参数
利用RLS算法实现参数的自适应估计 估计y(n) = 1.5*y(n-1)-0.7*y(n-2)+0.3*u(n-2)中的参数
是一个精典的递归加动态规化的题 题目:有M个苹果要求放入N个篮子中
是一个精典的递归加动态规化的题 题目:有M个苹果要求放入N个篮子中,求出放法的总数(N个篮子中放的苹果数不限定,有的也可以不放)
Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree
Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree structured wavelet ...
This m-file simulates MPSK (theoretical and simulated) with Gray coding This m-file simulates MPSK
This m-file simulates MPSK (theoretical and simulated) with Gray coding This m-file simulates MPSK (BPSK,QPSK,8PSK)with...
One-channel queuing system simulator (M/M/1) * Arrival and service times are random and distributed
One-channel queuing system simulator (M/M/1) * Arrival and service times are random and distributed exponetially. * ...