全文获取类型
收费全文 | 734篇 |
免费 | 13篇 |
国内免费 | 29篇 |
专业分类
化学 | 1篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 751篇 |
物理学 | 21篇 |
出版年
2023年 | 4篇 |
2022年 | 10篇 |
2021年 | 19篇 |
2020年 | 7篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 6篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 25篇 |
2013年 | 50篇 |
2012年 | 15篇 |
2011年 | 28篇 |
2010年 | 36篇 |
2009年 | 30篇 |
2008年 | 51篇 |
2007年 | 47篇 |
2006年 | 51篇 |
2005年 | 38篇 |
2004年 | 16篇 |
2003年 | 33篇 |
2002年 | 27篇 |
2001年 | 22篇 |
2000年 | 24篇 |
1999年 | 17篇 |
1998年 | 10篇 |
1997年 | 23篇 |
1996年 | 13篇 |
1995年 | 18篇 |
1994年 | 24篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 11篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有776条查询结果,搜索用时 812 毫秒
1.
M/G/1非空竭服务休假排队系统随机分解的简化算法 总被引:2,自引:0,他引:2
本文根据M/G/1非空竭服务休假排队系统稳态队长随机分解的结构特征提出一种统一算法,该方法简洁高效,避免了再生循环方法繁杂的运算。运用该方法得出的结果与已知的用再生循环方法得出的结论一致。并且修正了Levy(1989)关于Bernoulli闸门服务休假排队系统随机分解的一个错误。 相似文献
2.
3.
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where
a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The
result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed
communication networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
4.
In this paper, we provide numerical means to compute the quasi-stationary (QS) distributions inM/GI/1/K queues with state-dependent arrivals andGI/M/1/K queues with state-dependent services. These queues are described as finite quasi-birth-death processes by approximating the general distributions in terms of phase-type distributions. Then, we reduce the problem of obtaining the QS distribution to determining the Perron-Frobenius eigenvalue of some Hessenberg matrix. Based on these arguments, we develop a numerical algorithm to compute the QS distributions. The doubly-limiting conditional distribution is also obtained by following this approach. Since the results obtained are free of phase-type representations, they are applicable for general distributions. Finally, numerical examples are given to demonstrate the power of our method. 相似文献
5.
We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server. 相似文献
6.
Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint
distribution of several variables associated with the busy cycle inM/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dualGI/M/1. In this note, we generalize this duality relation toGI/G/1 queues with modified first services; this clarifies the original result, and shows that the generalized ballot theorem
is superfluous for the duality relation. 相似文献
7.
This paper studies the tail behavior of the fundamental period in the MAP/G/1 queue. We prove that if the service time distribution
has a regularly varying tail, then the fundamental period distribution in the MAP/G/1 queue has also regularly varying tail,
and vice versa, by finding an explicit expression for the asymptotics of the tail of the fundamental period in terms of the
tail of the service time distribution. Our main result with the matrix analytic proof is a natural extension of the result
in (de Meyer and Teugels, J. Appl. Probab. 17: 802–813, 1980) on the M/G/1 queue where techniques rely heavily on analytic expressions of relevant functions.
I.-S. Wee’s research was supported by the Korea Research Foundation Grant KRF 2003-070-00008. 相似文献
8.
Multi-dimensional asymptotically quasi-Toeplitz Markov chains with discrete and continuous time are introduced. Ergodicity
and non-ergodicity conditions are proven. Numerically stable algorithm to calculate the stationary distribution is presented.
An application of such chains in retrial queueing models with Batch Markovian Arrival Process is briefly illustrated.
AMS Subject Classifications Primary 60K25 · 60K20 相似文献
9.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems
in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient
algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such
tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable
bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric
sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key
idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation
then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance
sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates
it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for
the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.
相似文献
10.
We consider an M/G/1 queue with symmetric service discipline. The class of symmetric service disciplines contains, in particular, the preemptive
last-come-first-served discipline and the processor-sharing discipline. It has been conjectured in Kella et al. [1] that the
marginal distribution of the queue length at any time is identical for all symmetric disciplines if the queue starts empty.
In this paper we show that this conjecture is true if service requirements have an Erlang distribution. We also show by a
counterexample, involving the hyperexponential distribution, that the conjecture is generally not true.
AMS Subject Classifications Primary—60K25; Secondary—90B22 相似文献