-
show_polinterp
Numerical method - Langrageov polynom
- 2012-05-01 02:24:55下载
- 积分:1
-
SVM_Matlab_Sharp2
implementation of support vector machine
- 2013-11-30 12:51:32下载
- 积分:1
-
receive-diversity
仿真2×1瑞利信道,分别考虑三种接收分集技术:最大比合并、等增益合并、选择性合并,并给出误码率比较。(In a one transmitting antenna and two receiving antenna collocate,calculate the bits error rates of the maximum ratio combining,equal gain combining ,selective combining and SISO system)
- 2014-04-27 17:20:32下载
- 积分:1
-
chapter14
用matlab实现的SVM算法的回归模拟和预测的源代码,可以嵌入自己开发的应用程序中,应用matlab的SVMlib工具库实现的(the complementation of regression of SVM algorithm using matlab)
- 2020-12-29 16:29:01下载
- 积分:1
-
matlab
说明: 1对一段音频进行matlab双声道限时取样,并画图
2产生一段随机整数噪声,并加入到原样本中(1 on a two-channel audio matlab limited sampling, and drawing a random integer generated noise
2, and added to the original sample)
- 2011-03-19 20:59:34下载
- 积分:1
-
project
产生伪随机M序列,作为系统输入,可以改变级数(create M order number)
- 2012-05-16 22:48:44下载
- 积分:1
-
Matlab
卡尔曼滤波器是一个对动态系统的状态序列进行线性最小误差估计的算法,一般用于线性系统。一般在运动跟踪领域中摄像机相对于目标物体运动有时属于非线性系统,但由于在一般运动跟踪问题中图像采集时间间隔较短,可近似将单位时间内目标在图像中的运动看作匀速运动,采用卡尔曼滤波器可以实现对目标运动参数的估计。(Kalman filter is a state sequence of linear dynamic systems smallest error estimation algorithm for linear systems in general. Usually in the field of motion tracking camera motion with respect to the target object may belong to nonlinear systems, but in general due to motion tracking problems shorter image acquisition time interval, a unit of time can be approximated to the target motion in the image is regarded as uniform motion, Kalman filter can achieve the target motion parameter estimation.)
- 2015-03-25 11:33:57下载
- 积分:1
-
queuingsystem
matlab code of simple queuing system
- 2010-11-21 14:34:09下载
- 积分:1
-
metrics2D.cpp
This is the source code for 2D metrics in gird generation.
- 2014-11-22 03:30:49下载
- 积分:1
-
ga_tsp
This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...
- 2013-04-09 22:15:26下载
- 积分:1