全文获取类型
收费全文 | 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条查询结果,搜索用时 253 毫秒
641.
642.
643.
S.W Fuhrmann 《Operations Research Letters》1985,4(3):139-144
Consider a symmetrical system of n queues served in cyclic order by a single server. It is shown that the stationary number of customers in the system is distributed as the sum of three independent random variables, one being the stationary number of customers in a standard M/G/1 queue. This fact is used to establish an upper bound for the mean waiting time for the case where at most k customers are served at each queue per visit by the server. This approach is also used to rederive the mean waiting times for the cases of exhaustive service, gated service, and serve at most one customer at each queue per visit by the server. 相似文献
644.
645.
A retrial queue accepting two types of customers with correlated batch arrivals and preemptive resume priorities is studied. The service times are arbitrarily distributed with a different distribution for each type of customer and the server takes a single vacation each time he becomes free. For such a model the state probabilities are obtained both in a transient and in a steady state. Finally, the virtual waiting time of an arbitrary ordinary customer in a steady state is analysed. 相似文献
646.
We consider aM/G/1 queue modified such that an arriving customer may be totally or partially rejected depending on a r.v. (the barricade) describing his impatience and on the state of the system. Three main variants of this scheme are studied. The steady-state distribution is expressed in terms of Volterra equations and the relation to storage processes, dams and queues with state-dependent Poisson arrival rate is discussed. For exponential service times, we further find the busy period Laplace transform in the case of a deterministic barricade, whereas for exponential barricade it is shown by a coupling argument that the busy period can be identified with a first passage time in an associated birth-death process. 相似文献
647.
This paper presents several basic algorithms for the parallel simulation of G/G/1 queueing systems and certain networks of such systems. The coverage includes systems subject to manufacturing or communication
blocking, or to loss of customer due to capacity constraints. The key idea is that the customer departure times are represented
by longest-path distance in directed graphs instead of by the usual recursive equations. This representation leads to scalable
algorithms with a high degree of parallelism that can be implemented on either MIMD or SIMD parallel computers.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
648.
Consider an ATM multiplexer where M input links contend for time slots on an output link which transmits C cells per second. Each input link has its own queue of size B cells. The traffic is delay sensitive so B is small (e.g., B=20). We assume that each of the M input links carries Constant Bit Rate (CBR) traffic from a large number of independent Virtual Connections (VCs) which are
subject to jitter. The fluctuations of the aggregate traffic arriving at queue i, i=1,...,M, is modeled by a Poisson process with rate λi. The Quality of Service (QoS) of one connection is determined in part by the queueing delay across the multiplexer and the
Cell Loss Ratio (CLR) or proportion of cells from this connection lost because the buffer is full. The Oldest‐Customer(Cell)‐First
(OCF) discipline is a good compromise between competing protocols like round‐robin queueing or serving the longest queue.
The OCF discipline minimizes the total cell delay among all cells arriving at the contending queues. Moreover, the CLR is
similar to that obtained by serving the longest queue. We develop QoS formulae for this protocol that can be calculated on‐line
for Connection Admission Control (CAC). These formulae follow from a simple new expression for the exact asymptotics of a
M/D/1 queue.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
649.
Manfred Kramer 《Queueing Systems》1989,5(4):369-379
We consider a queueing system with bulk arrivals entering a finite waiting room. Service is provided by a single server according to the limited service discipline with server vacation times. We determine the distributions of the time-dependent and stationary queue length in terms of generating functions by a symbolic operator method. 相似文献
650.
This paper deals with the problem of the optimal service rate control in the system with BMAP (Batch Markovian Arrival Process)
arrival stream. An algorithm for the computation of the embedded stationary queue length distribution is developed. The procedure
for the cost criteria calculation is elaborated for any fixed parameters of the multithreshold control policy.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献