搜索资源列表
MM1
- M/M/1单服务台派对系统，（用事件调度法实现离散事件系统仿真） 顾客到达模到达时间间隔和顾客服务时间均服从负指数分布，单服务台系统，按照单队排队，按FIFO方式服务。考察服务n个顾客后的顾客平均队长及平均排队等待时间-M/M/1 single desk party system (with the event scheduling system for discrete event simulation) model to reach customers arrival time and cu
LCCsimulation
- 通过MATLAB实现对无排队等待的呼叫系统的仿真，并且得出在不同的呼叫到达速率下系统的阻塞率，并且和理论的erlangB公式做出对比。-MATLAB to achieve through the call without waiting in line system simulation, and come to a different call arrival rate in the system blocking rate, and the formulas and theories erl
Monte-Carlo-method-wait
- 用蒙特卡洛法实现对排队等待问题的计算机模拟,很有学习价值，大家可以参考下，-Monte Carlo method to realize the problem of computer simulation of waiting in line, great learning value, we can refer to, huh, huh
stop
- 由于停车场是一个狭窄通道，问题要求汽车“到达”或“离去”信息。由此很容易联想到数据结构中的堆栈模型，因此可首先设计一个堆栈，以堆栈来模拟停车场，又每个汽车的车牌号都不一样，这样一来可以根据车牌号准确找到汽车位置，所以堆栈里的数据元素我设计成汽车的车牌号。当停车场内某辆车要离开时，在他之后进入的车辆必须先退出车场为它让路，待该辆车开出大门外，其他车辆再按原次序进入停车场。这是一退一进的过程，而且让道的汽车必须保持原有的先后顺序，因此可再设计一个堆栈，以之来暂时存放为出站汽车暂时让道的汽车车牌号。当
a2
- Implementation a simple FIFO queue using arrays. Write a programs that will ask the user for the size of the queue. Then it will start reading characters from the keyboard and store them in the queue. If the user enters an empty line then the progr
a3
- Implementation a simple FIFO queue using linked lists. Write a programs that will ask the user for the size of the queue. Then it will start reading characters from the keyboard and store them in the queue. If the user enters an empty line then the
seedoctor
- 编写一个程序，反应病人到医院看病，排队看医生的情况。在病人排队的过程中，主要重复两件事： （1）病人到达诊室，将病历本交给护士，排到等待队列中等候诊。 （2）护士从等待队中列中取出一位病人的病例，该病人进入诊室就诊。 要求模拟病人等待就诊这一过程。程序采用菜单方式，器选项及功能说明如下： 1排队——输入排队病人的病历号，加入到病人排队队列中。 2就诊——病人排队队列中最前面的病人就诊，并将其从列队中删除。 3查看队列——从队首到队尾列出所有的排队病
car
- 本程序是实行一个停车管理系统功能。可实现排队等候、记录车位号、记录出入停车场时间、计算收费等功能。-This program is the implementation of a parking management system functions.Waiting in line to achieve record number of parking spaces, access to parking time records, calculate charges and other func
1017
- 浙大 编程能力测试 的甲级题目 第 1017. Queueing at Bank (25) 服务窗口排队问题-Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yell
1014
- 浙大 编程能力测试 的甲级题目 第 1014. Waiting in Line (30) 又是一道服务队列问题-uppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are: