理学 >>> 数学 >>> 运筹学 >>> 排队论 >>>
搜索结果: 1-15 共查到知识库 排队论相关记录23条 . 查询时间(5.076 秒)
In a recent study [1] the stationary state of a parallel-update TASEP with varying system length,which can be regarded as a queueing process with excluded-volume effect (exclusive queueing process,EQP...
The problem of genealogy of permutations has been solved par-tially by Stefan (odd order) and Acosta-Humanez & Bernhardt (power of two).It is well known that Sharkovskii's theorem shows the relations...
In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performancemetric t...
The Nottingham group N(k) over a field k of characteristic p > 0 is the group of continuous automorphisms of the ring k[[t]] which are equal to the identity modulo t2. The object of this paper is to...
Performance analysis of queueing networks is one of the most challenging areas of queueing theory.Barring very specialized models such as product-form type queueing networks, there exist very few resu...
In this paper we consider the rank generating function of a separable permutation  in the weak Bruhat order on the two intervals [id, ] and [,w0],where w0 = n, (n−1), . . . , 1. We show a sur...
This paper provides extensions of the work on subsampling by Bertail et al. (2004) for strongly mixing case to weakly dependent case by application of the results of Doukhan and Louhichi (1999).We in...
A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the ...
In this paper, we show that those sequential products which were proposed by Liu and Shen and Wu in [J. Phys. A: Math. Theor. 42, 185206 (2009), J. Phys. A: Math. Theor. 42, 345203 (2009)] are just u...
We consider the problem of enumerating permutations in the symmetric group on n elements which avoid a given set of consecutive pattern S, and in particular computing asymptotics as n tends to infin...
In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees. Speci cally, we consider classes of trees that have a given set of leaves or that have a xe...
In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees. Speci cally, we consider classes of trees that have a given degree sequence or a given mult...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the correspondi...
Two of the most popular approximations for the distribution of the steady-state waiting time, W1, of the M/G/1 queue are the so-called heavy-trac approximation and heavy-tailed asymptotic, re-spectiv...
The jeep problem was first solved by O. Helmer and N.J. Fine. But not much later, C.G. Phipps formulated a more general solution. He formulated a so-called convoy or caravan variant of the jeep proble...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...