-
Myquantize
说明: 用S函数编写的量化器
量化步长为非线性
即 量化步长可调
(Prepared by S function to quantify the quantizer step size for the non-linear quantization step size that is adjustable)
- 2009-08-07 09:23:32下载
- 积分:1
-
matlab-AG
建立了带硬时间窗车辆路线问题的数学模型,并应用matlab软件检验了其正确性。设计了用遗传算法求解该数学模型的算法思路,即采用自然数编码的方法使得交叉和变异操作得以更加简便的进行(based on GA solve the mutil-objects problem with the help of time window)
- 2013-04-11 19:01:50下载
- 积分:1
-
cdma2000_Matlab
用matlab编写的cdma2000基带信号源的仿真程序,主要实现编码调制部分。。(Prepared using matlab cdma2000 baseband signal source simulation program, the main code modulation section. .)
- 2013-12-28 10:59:25下载
- 积分:1
-
HYPENS
Petri网仿真工具。。。。。。。。。。。。。。。(Petri Ney simulation tool)
- 2019-03-21 18:59:57下载
- 积分:1
-
kalman_filter_linear
说明: 线性卡尔曼滤波模型,利用simulink模型搭建(linear Kalman filter and Simulink are used to build the model in detail)
- 2020-12-14 15:46:18下载
- 积分:1
-
MATLAB-GUI
matlab GUI 编程入门参考文献,初级学者可以看看(matlab GUI)
- 2015-04-04 16:09:54下载
- 积分:1
-
MILCOM_1998
1998年的MILCOM会议相关论文材料。(1998 MILCOM)
- 2013-05-21 21:05:44下载
- 积分:1
-
RSMlognorm
响应面法计算相关系数情况下结构的可靠度.已知极限状态方程,变量服从对数正态分布,变量均值和标准差已知,且知道变量的相关系数。(Response surface methodology to calculate the correlation coefficient of reliability under the circumstances structures known to limit state equation, variables lognormal distribution, the mean and the standard deviation is known variables, and that the correlation coefficient variables.)
- 2013-12-30 15:21:54下载
- 积分:1
-
Finite_time_Sim
群集行为是多智能体系统研究中的一个重要问题,其主要任务是给出多个智能体基于局部信息实现群集行为的条件,本文针对信息交换拓扑保持连通性的群集行为展开研究,主要内容如下(Swarming behavior is an important problem in the research of multi-agent system, its main task is to give a local agent information to realize the swarm behavior based on the condition, according to the topology preserving connectivity of the cluster behavior information exchange, the main contents are as follows)
- 2017-08-09 15:32:20下载
- 积分:1
-
kmeans
说明: k均值算法是一种迭代求解的聚类分析算法,其步骤是随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。(kmeans algorithm is an iterative solution clustering analysis algorithm. First, the initial clustering centers are randomly selected. Then, distance between between each point ans others are calculated, and each data point is designed to its nearest clustering center.)
- 2020-06-21 23:40:01下载
- 积分:1