登录
首页 » matlab » queueM

queueM

于 2012-10-18 发布 文件大小:1KB
0 223
下载积分: 1 下载次数: 25

代码说明:

  使用matlab编写的排队算法,队列长度为m(Queuing algorithm, using matlab queue length m)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • mfbox-1.06
    toolbox for spm 5 for data, model free analysis
    2009-03-06 12:44:28下载
    积分:1
  • heat-exchanger-optimization-design
    基于Matlab 换热器的最优化设计的matlab源程序。。(Matlab-based heat exchanger optimization design)
    2020-06-29 00:00:02下载
    积分:1
  • 6D
    说明:  运用Matlab编程,实现了结构的刚度矩阵和质量矩阵的凝聚。(Using Matlab programming, to achieve the structural stiffness matrix and mass matrix condensation. )
    2012-03-31 10:37:16下载
    积分:1
  • nedi
    基于插值的超分辨率NEDI算法,用matlab实现(The super-resolution interpolation algorithm based NEDI)
    2021-04-23 15:58:48下载
    积分:1
  • PNVG
    磷酸铁锂电池的simulink模型,用来监测电池的运行状态(Lithium iron phosphate simulink model to monitor the operating status of the battery)
    2016-12-17 14:38:56下载
    积分:1
  • gps
    基于matlab的gps系统定位仿真,模拟伪距测量结果,进行用户定位计算(Gps system based on matlab the positioning simulation, analog pseudorange measurements, user location)
    2013-03-15 21:44:30下载
    积分:1
  • mojidazhi
    一个MATLAB程序算例,即求模最大值的程序,相互学习用。(Example of a MATLAB program, that is seeking the maximum modulus of the procedures used to learn from each other.)
    2007-08-25 11:38:05下载
    积分:1
  • SVC_PSOGSA
    Optimal SVC by PSOGSA
    2015-02-14 22:24:44下载
    积分:1
  • Buck_pcc-(2)
    Buck peak current mode control
    2017-02-14 13:28:37下载
    积分:1
  • 101259363Desktop
    传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)
    2017-07-18 12:05:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载