搜索资源列表
ShortPth
- 图论：最短路径算法实现 Graph.gph GraphBFS.h GraphM.h GraphOpr.h Queue.h sample.gph ShortPth.cpp ShortPth.dsp ShortPth.dsw ShortPth.ncb ShortPth.opt ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Gra
paidui
- mm1排队模型的matlab源码，从c语言裸转过来的，主要解决排队论在matlab中的仿真问题-mm1 queue model matlab source code, from the c language naked in turn, mainly queuing theory to solve the simulation problem in matlab
matlab
- 可实现银行排队论mmm，输出随机数matlab实现计算机模拟排队论-Bank of queuing theory can be realized mmm, the output random number matlab computer simulation of queuing theory to achieve
Bipartite
- 图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea
sdma
- 用于SDMA排队论的MATLAB程序，主要实现食堂排队的模拟仿真-For SDMA queuing theory MATLAB program, the main canteen queue simulation to achieve
mPmP1
- M/M/1,单服务台排队系统的分析，标准的M/M/1模型-M/M/1,QUEUE THEORY
queuetheory
- 排队论编程，单柜台，泊松分布到达，指数分布服务时间，求解平均等待队长-Queuing theory to programming, a single counter, Poisson arrival, exponential service time, average waiting queue length for solving
Queue_series_1
- 排队论随机模拟，用蒙特卡罗的方法，通过模拟计算出排队长度，等待时间等。-Stochastic simulation of queuing theory, Monte Carlo method, calculated by simulating the queue length, waiting time.
code
- 模拟排队论中的ErlangA模型，到达时间，服务时间，放弃时间服从指数分布-simulation about queue theory
mm1
- mm1队列的仿真，还得出了统计给定到达率和离去率条件下系统的平均队列长度和平均等待时间，并与理论结果进行比对。-MM1 queue of simulation, it reaches a statistics given arrival rate and leave rate of the system under the condition of the average queue length and waiting time, on average, and the results com
queue-theory
- 通过Matlab 平台实现了排队论中M/M/1/N/∞ 模型的过程仿真。-Matlab platform for process simulation of queuing theory M/M/1/N/∞ model.
bankqueue
- 基于排队论实现银行业务窗口平均排队长度、平均等待时间的计算。-Queuing theory-based banking window average queue length, average wait time calculation.
MMCqueue
- In queueing theory, the M/M/c queue is a multi-server queueing model.[1] In Kendall s notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers and job service times are exponentially
Graph
- 图论的各种最短路算法,竞赛用 包括dijkstra、Bellman-Ford（SPFA）、Floyd-Warshall、优先队列的应用等-A variety of graph theory shortest path algorithm, racing including dijkstra, Bellman-Ford (SPFA), Floyd-Warshall, the application of the priority queue
MM1
- 解决M/M/1排队论问题，服务时间服从指数分布，队列为泊松流。系统输出为每个个体的到达时间，离开时间，等待时间，逗留时间-M/M/1 queuing theory to solve the problem, the service time is exponentially distributed, the queue is Poisson. System output for each individual arrival time, departure time, waiting time,
Queue
- 运筹学，排队论 M/M/1队列 littlt定理 Matlab模拟仿真-Operations research, queuing theory M/M/1 queue littlt theorem Matlab simulation
M/G/1 queue model
- The code of Queue theory M/G/1 model in Matlab
paiduilun
- 排队论(Queuing Theory) ，是研究系统随机聚散现象和随机服务系统工作过程的数学理论和方法，又叫随机服务系统理论，为运筹学的一个分支。又称服务系统，是排队系统模型的基本组成部分。排队论(queuing theory), 或称随机服务系统理论， 是通过对服务对象到来及服务时间的统计研究，得出这些数量指标(等待时间、排队长度、忙期长短等)的统计规律，然后根据这些规律来改进服务系统的结构或重新组织被服务对象，使得服务系统既能满足服务对象的需要，又能使机构的费用最经济或某些指标最优。-Que