全文获取类型
收费全文 | 680篇 |
免费 | 13篇 |
国内免费 | 32篇 |
专业分类
综合类 | 7篇 |
数学 | 702篇 |
物理学 | 16篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 17篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 3篇 |
2014年 | 22篇 |
2013年 | 37篇 |
2012年 | 19篇 |
2011年 | 28篇 |
2010年 | 32篇 |
2009年 | 27篇 |
2008年 | 40篇 |
2007年 | 51篇 |
2006年 | 49篇 |
2005年 | 36篇 |
2004年 | 17篇 |
2003年 | 35篇 |
2002年 | 25篇 |
2001年 | 24篇 |
2000年 | 27篇 |
1999年 | 15篇 |
1998年 | 10篇 |
1997年 | 21篇 |
1996年 | 14篇 |
1995年 | 17篇 |
1994年 | 28篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有725条查询结果,搜索用时 15 毫秒
91.
J. A. Morrison 《Queueing Systems》1989,4(3):213-235
A birth-death queueing system with asingle server, first-come first-served discipline, Poisson arrivals and state-dependent mean service rate is considered. The problem of determining the equilibrium densities of the sojourn and waiting times is formulated, in general. The particular case in which the mean service rate has one of two values, depending on whether or not the number of customers in the system exceeds a prescribed threshold, is then investigated. A generating function is derived for the Laplace transforms of the densities of the sojourn and waiting times, leading to explicit expressions for these quantities. Explicit expressions for the second moments of the sojourn and waiting times are also obtained. 相似文献
92.
93.
94.
F. Avram 《Operations Research Letters》2006,34(3):339-348
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector. 相似文献
95.
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The
customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this
contribution, we analyze a discrete-time two-class preemptive repeat identical priority queue with infinite buffer space and
generally distributed service times. Newly arriving high-priority customers interrupt the on-going service of a low-priority
customer. After all high-priority customers have left the system, the interrupted service of the low-priority customer has
to be repeated completely. By means of a probability generating functions approach, we analyze the system content and the
delay of both types of customers. Performance measures (such as means and variances) are calculated and the impact of the
priority scheduling is discussed by means of some numerical examples. 相似文献
96.
Arzad A. Kherani 《Queueing Systems》2006,53(3):159-169
In this paper we present a direct approach to obtaining joint distributions of various quantities of interest in a busy period
in an M/M/1 queue. These quantities are: the sojourn times and waiting times of all the customers in the busy period, the busy period length and the number of customers served in a busy period. Since the evolution
of the total workload process between two successive customer arrivals is deterministic, this work gives statistic of the
complete evolution of the workload process within a busy period.
This work was done when the author was post doctoral fellow with the MAESTRO group at INRIA, Sophia Antipolis, France, and
was supported by project no. 2900-IT-1 from the Centre Franco-Indien pour la Promotion de la Recherche Avancee (CEFIPRA). 相似文献
97.
本文首次研究服务员具有多重休假规则的成批到达Mx/G/1排队系统的输出过程.应用更新过程理论、拉普拉斯-司梯阶变换和本文提出的直接概率分解分析法,讨论了从任意初始状态出发,系统在(0,t]时间内输出顾客的平均数,以及其渐近展开,得到一些重要结果. 相似文献
98.
Wolfgang Stadje 《Operations Research Letters》1997,20(5):229-235
It is proved that a certain kind of randomly discounted random sums is asymptotically normal as the discount constant tends to zero. For replaceable systems with random lifetime, these sums represent the total discounted cost of policies of the age-replacement type; other applications to queueing and related areas are also indicated. 相似文献
99.
A symmetric queue is known to have a nice property, the so-called insensitivity. In this paper, we generalize this for a single node queue with Poisson arrivals and background state, which changes at completion instants of lifetimes as well as at the arrival and departure instants. We study this problem by using the decomposability property of the joint stationary distribution of the queue length and supplementary variables, which implies the insensitivity. We formulate a Markov process representing the state of the queue as an RGSMP (reallocatable generalized semi-Markov process), and give necessary and sufficient conditions for the decomposability. We then establish general criteria to be sufficient for the queue to possess the property. Various symmetric-like queues with background states, including continuous time versions of moving server queues, are shown to have the decomposability.This author is partially supported by NEC C&C Laboratories. 相似文献
100.
Masakiyo Miyazawa 《Queueing Systems》1997,25(1-4):45-75
We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent
routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which
means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion
is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types
of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for
any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network
models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages
of this kind of queueing networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献