-
mcr_toolbox
化学计量学MCR-PLS的matlab代码及操作界面，可以直接调出选择参数界面进行选择(Chemometric MCR-PLS code and user interface, you can directly call up the selection parameters interface to select)
- 2012-05-27 11:20:04下载
- 积分：1
-
chirp_gabor
不错的chirp方向识别例程，可对chirp进行分解，供参考(Good chirp direction identification routine, the decomposition of the chirp for reference)
- 2013-03-28 10:38:17下载
- 积分：1
-
1
说明： 计算方法数值方程，用列主元Gauss消去法解释线性方程组Ax=b，其中A=[10E-8 2 3,-1 3.712 4.623,-2 1.072 5.643],b=[1,2,3](Calculated value equation, the main-element Gauss elimination explanation of linear equations Ax = b, where A = [10E-8 2 3,-1 3.712 4.623,-2 1.072 5.643], b = [1,2,3 ])
- 2010-08-26 21:04:30下载
- 积分：1
-
proficientmatlabfinancialcalculations
此资料为《精通matlab金融计算》一书中的光盘程序程序(This information is " proficient matlab financial calculations," a book of the CD-ROM program program)
- 2010-12-06 11:17:10下载
- 积分：1
-
benchmark
该函数由于遗传算法，粒子群算法等各类测试，可以很好地对你所编程序进行评估，以验证你提出的算法的合理性(Function due to genetic algorithms, particle swarm optimization, and other tests can be well on your programmed assessment, to verify the rationality of the proposed algorithm)
- 2012-04-07 09:23:09下载
- 积分：1
-
Pulse_shaping_LUT
通信仿真：
利用Matlab实现的脉冲成型仿真(Communication Simulation : Matlab Pulse Forming Simulation)
- 2007-05-20 16:54:13下载
- 积分：1
-
bpsk
BPSK调制 通信原理中的类容 BPSK (BPSK modulation)
- 2013-04-15 20:30:17下载
- 积分：1
-
smos1_upr
Some m-files about digital signal synthesys
- 2011-12-29 21:22:44下载
- 积分：1
-
suijimoni1
刘宝碇《不确定规划及应用》第4章例4.3的matlab程序。内容简单，但可以有效的帮助初学者理解随机模拟的原理。(Liu anchor " uncertain Planning and Applications" in Chapter 4 Example 4.3 matlab program. Content is simple, but can effectively help beginners understand the principles of stochastic simulation.)
- 2015-03-20 10:10:49下载
- 积分：1
-
RRT-star-master
RT（快速扩展随机树）是一种基于采样的算法求解路径规划问题。RRT提供可行的解如果时间RRT趋于无穷大。
RRT *是一个基于采样的算法为解决运动规划问题，这是一个概率最优变异性。RRT *收敛到最优解的渐近。
RRT * FN是一个基于采样的算法基于RRT *。RRT * FN内在渐近收敛到最优解，然而RRT * FN实现使用更少的内存(RRT (Rapidly-Exploring Random Tree) is a sampling-based algorithm for solving path planning problem. RRT provides feasable solution if time of RRT tends to infinity.
RRT* is a sampling-based algorithm for solving motion planning problem, which is an probabilistically optimal variant of RRT. RRT* converges to the optimal solution asymptotically.
RRT*FN is a sampling-based algorithm based on RRT*. RRT*FN inherents asymptotical convergence to the optimal solution, however RRT*FN implements it using less memory.)
- 2017-07-21 11:05:22下载
- 积分：1
