-
SCEGET
shuffled complex evolution method (function)
- 2013-12-13 03:54:02下载
- 积分:1
-
automatic-control--MATLAB
有关自动控制原理的相关MATLAB例程。使用MATLAB进行求解相关的问题,如:根轨迹,波特图。(The relevant MATLAB routines for the automatic control principle. Solve related problems using MATLAB, such as: root locus, Bode plot.)
- 2016-12-27 11:25:52下载
- 积分:1
-
matlab
matlab编写的粒子滤波算法,已经在工程样机上得到验证,希望对大家有帮助(matlab prepared particle filter algorithm, the engineering prototype has been tested on, and they hope to have everyone help)
- 2009-03-15 02:56:44下载
- 积分:1
-
matlab-code
matlab解线性方程组的源代码
function x=nagauss2(a,b,flag)
% 用途:选列主元Gauss消去法解线性方程组ax=b
% 格式:x=nagauss2(a,b,flag) a为系数矩阵,b为右端列向量,flag若为0,则显示中间过程
(Matlab solution of linear equations source code function nagauss2 x = (a , b, flag)% purposes : a selection PCA Gauss elimination method for solving linear equations ax = b% Format : nagauss2 x = (a, b, flag) for a coefficient matrix, b subguadratic column vector, if the flag is 0, then showed intermediate process)
- 2006-06-02 11:52:10下载
- 积分:1
-
pdf_use_GramCharlier
用著名的Gram-Charlier级数展开画变量的概率密度曲线或累积分布曲线。在程序中可选。需要用到6阶半不变量。(Use the famous painting Gram-Charlier series expansion to plot the probability density curve or cumulative distribution curve. Need to use 6-order half-invariant.)
- 2015-04-17 11:28:44下载
- 积分:1
-
three_side
用于实现节点定位的三边定位算法的matlab代码,包含了对定位误差的仿真(Trilateral achieve node localization algorithm is used to locate the matlab code, including the simulation of positioning error)
- 2014-02-21 16:09:08下载
- 积分:1
-
PSAM
psam用户手册,对sam卡学习有帮助。(psam user manual, learning on the sam card help)
- 2010-11-23 18:04:16下载
- 积分:1
-
ss-ts
本代码前部分为空间平滑算法代码,后半部分为时间平滑算法。(Spatial Smoothing,Time Smoothing)
- 2012-05-06 21:01:14下载
- 积分:1
-
2008-06
It is the document related to noise reduction
- 2013-08-03 02:17:10下载
- 积分:1
-
FT
说明: 禁忌(Tabu Search)算法是一种亚启发式(meta-heuristic)随机搜索算法,它从一个初始可行解出发,选择一系列的特定搜索方向(移动)作为试探,选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解,TS搜索中采用了一种灵活的“记忆”技术,对已经进行的优化过程进行记录和选择,指导下一步的搜索方向,这就是Tabu表的建立。(Tabu Search algorithm is a meta-heuristic random search algorithm. It starts from an initial feasible solution, chooses a series of specific search directions (movement) as a trial, and chooses to achieve the movement that makes the most changes in the value of a specific objective function. To avoid falling into local optimum, TS search uses a flexible "memory" technology to record and select the optimization process that has been carried out, and to guide the next search direction, which is the establishment of Tabu table.)
- 2020-12-19 20:59:09下载
- 积分:1