登录
首页 » matlab » simulation-the-queue-process

simulation-the-queue-process

于 2011-04-20 发布 文件大小:1KB
0 244
下载积分: 1 下载次数: 23

代码说明:

  用Matlab实现排队过程的仿真 matlab仿真 画出等待时间和离开时间的图像(use matlab to simulation the queue process )

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

发表评论

0 个回复

  • LS
    说明:  基于ofdm,利用导频Comb Pilot进行信道估计,(Based on ofdm, use Comb Pilot to pilot channel estimation,)
    2009-04-20 20:53:20下载
    积分:1
  • gravity
    对自由落体运动进行仿真,并将仿真出来的数据与理论分析数据进行比对。(On the free fall simulation, and simulation and theoretical analysis of the data out of the data for comparison.)
    2013-07-23 10:20:19下载
    积分:1
  • Abbas-Siyadati_Active-Filter1
    Single-Phase to Three-Phase Universal Active Power Filter
    2014-08-22 19:21:58下载
    积分:1
  • DetectionofFlickerCaused
    详细描述了电力系统由于间谐波的引起的闪变,和原因(As described in detail between the harmonic power system caused by flicker, and the reasons)
    2010-09-14 23:08:06下载
    积分:1
  • pca
    本程序基于MATLAB仿真工具实现主分量分析(The program is based on MATLAB simulation tools principal component analysis)
    2010-10-18 21:45:55下载
    积分:1
  • AAA
    轴承故障信号的诊断方法,时延相关预处理对振动信号做预处理,可以起到解调的作用(Diagnosis bearing fault signal delay associated pretreatment on the vibration signal preprocessing, can play a role demodulated)
    2016-03-17 16:08:28下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • wartermarking
    digital wartermarking 2D image from matlab source
    2010-12-02 14:30:31下载
    积分:1
  • match
    该函数通过调用MATLAB库函数noemxcorr(),实现简单的模板模式匹配功能,性能优异(The MATLAB function by calling the library function noemxcorr (), to achieve a simple template pattern matching functionality, performance)
    2014-10-05 16:38:20下载
    积分:1
  • ComputeRGBHistogram
    Compute image RGB histogram
    2015-02-14 22:38:53下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载