全文获取类型
收费全文 | 111篇 |
免费 | 1篇 |
国内免费 | 1篇 |
专业分类
综合类 | 1篇 |
数学 | 109篇 |
物理学 | 3篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2016年 | 1篇 |
2013年 | 14篇 |
2012年 | 6篇 |
2011年 | 7篇 |
2010年 | 7篇 |
2009年 | 9篇 |
2008年 | 8篇 |
2007年 | 9篇 |
2006年 | 11篇 |
2005年 | 2篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1988年 | 2篇 |
1983年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有113条查询结果,搜索用时 15 毫秒
11.
一个具有随机丢弃分组机制且分组成批到达的GI~X/M/1/N排队系统 总被引:3,自引:0,他引:3
汪浩 《数学的实践与认识》2005,35(9):113-120
利用排队论中输入流稀疏化的方法,在标准的GIX/M/1/N排队系统中嵌入网络交换设备随机丢弃分组的机制,建立了一个具有随机丢弃分组机制的扩充的GIX/M/1/N排队系统,并讨论了该排队系统的分组丢失率、系统利用率、队列长度的均值/方差、平均等待时间等性能评价指标. 相似文献
12.
A. Gmez-Corral 《Operations Research Letters》2002,30(6)
Our interest is in the study of the MAP/PH/1/1→·/PH/1/K+1 queue with blocking and repeated attempts. The main feature of its infinitesimal generator is the spatial heterogeneity caused by the transitions due to successful repeated attempts. We develop an algorithmic solution by making a simplifying approximation which yields an infinitesimal generator which is spatially homogeneous and has a modified matrix-geometric stationary vector. The essential tool in our analysis is the general theory on quasi-birth-and-death processes. 相似文献
13.
A queue layout of a graph consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested. In this paper, we show that the n-dimensional hypercube Qn can be laid out using n−3 queues for n?8. Our result improves the previously known result for the case n?8. 相似文献
14.
Nawel Gharbi Malika Ioualalen 《Journal of Computational and Applied Mathematics》2010,234(3):625-9932
Systems with vacations are usually modeled and analyzed by queueing theory, and almost all works assume that the customer source is infinite and the arrival process is Poisson. This paper aims to present an approach for modeling and analyzing finite-source multiserver systems with single and multiple vacations of servers or all stations, using the Generalized Stochastic Petri nets model. We show how this high level formalism, allows a simple construction of detailed and compact models for such systems and to obtain easily the underlying Markov chains. However, for real vacation systems, the models may have a huge state space. To overcome this problem, we give the algorithms for automatically computing the infinitesimal generator, for the different vacation policies. In addition, we develop the formulas of the main exact stationary performance indices. Through numerical examples, we discuss the effect of server number, vacation rate and vacation policy on the system’s performances. 相似文献
15.
The arrival of a negative customer to a queueing system causes one positive customer to be removed if any is present. Continuous-time queues with negative and positive customers have been thoroughly investigated over the last two decades. On the other hand, a discrete-time Geo/Geo/1 queue with negative and positive customers appeared only recently in the literature. We extend this Geo/Geo/1 queue to a corresponding GI/Geo/1 queue. We present both the stationary queue length distribution and the sojourn time distribution. 相似文献
16.
This paper considers an infinite server queue in continuous time in which arrivals are in batches of variable size X and service is provided in groups of fixed size R. We obtain analytical results for the number of busy servers and waiting customers at arbitrary time points. For the number of busy servers, we obtain a recursive relation for the partial binomial moments both in transient and steady states. Special cases are also discussed 相似文献
17.
18.
19.
Vittoria de Nitto Personè 《Annals of Operations Research》2009,170(1):95-112
The aim of this paper is to improve the machine interference model with vacation to deal with more recent problems of the
communication area. To this scope the model is extended to include parallelism in the vacation station. The underlying Markov
process is analyzed and a state arrangement is found that yields an efficient matrix-analytic technique that substantially
lowers down the time- and space-complexity of standard methods. A numerical example of the method effectiveness is presented,
and an example of resource allocation is introduced that finds applications in the QoS management of wireless networks.
The author is thankful to the anonymous referees for the improvements their comments have earned to the quality of the presentation
and to the completeness of the paper. The author is thankful to Giuseppe Iazeolla, whose careful reading of the original draft
of this paper led to significant improvements in its overall quality. This work was partially supported by funds from the
FIRB project “Performance Evaluation of Complex Systems: Techniques Methodologies and Tools” and by the University of Roma
TorVergata project on High Performance ICT Platforms. 相似文献
20.
Lin and Ke consider the M/M/R queue with working vacation [Chuen-Horng Lin, Jau-Chuan Ke, Multi-server system with single working vacation, Appl. Math. Modell. (2008), doi:10.1016/j.apm.2008.10.006], and derive a computable explicit form for rate matrix R of the geometric approach and the stationary probabilities of the queue. However, it contains some errors concerning the terminology, notations and the final form of rate matrix R. This note shows that the classical Quasi-birth-death (QBD) formulation of the M/M/R queue with working vacation naturally leads to the infinitesimal generator matrix of the QBD process and the probability interpretation of matrices involving in the infinitesimal generator matrix. 相似文献