全文获取类型
收费全文 | 594篇 |
免费 | 10篇 |
国内免费 | 26篇 |
专业分类
综合类 | 2篇 |
数学 | 612篇 |
物理学 | 16篇 |
出版年
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 14篇 |
2020年 | 5篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 4篇 |
2016年 | 10篇 |
2015年 | 3篇 |
2014年 | 16篇 |
2013年 | 32篇 |
2012年 | 11篇 |
2011年 | 20篇 |
2010年 | 26篇 |
2009年 | 22篇 |
2008年 | 37篇 |
2007年 | 39篇 |
2006年 | 44篇 |
2005年 | 35篇 |
2004年 | 13篇 |
2003年 | 32篇 |
2002年 | 24篇 |
2001年 | 20篇 |
2000年 | 24篇 |
1999年 | 14篇 |
1998年 | 9篇 |
1997年 | 21篇 |
1996年 | 13篇 |
1995年 | 16篇 |
1994年 | 23篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 13篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有630条查询结果,搜索用时 15 毫秒
1.
We consider a two-echelon inventory system with a number of non-identical, independent ‘retailers’ at the lower echelon and a single ‘supplier’ at the upper echelon. Each retailer experiences Poisson demand and operates a base stock policy with backorders. The supplier manufactures to order and holds no stock. Orders are produced, in first-come first-served sequence, with a fixed production time. The supplier therefore functions as an M/D/1 queue. We are interested in the performance characteristics (average inventory, average backorder level) at each retailer. By finding the distribution of order lead time and hence the distribution of demand during order lead time, we find the steady state inventory and backorder levels based on the assumption that order lead times are independent of demand during order lead time at a retailer. We also propose two alternative approximation procedures based on assumed forms for the order lead time distribution. Finally we provide a derivation of the steady state inventory and backorder levels which will be exact as long as there is no transportation time on orders between the supplier and retailers. A numerical comparison is made between the exact and approximate measures. We conclude by recommending an approach which is intuitive and computationally straightforward. 相似文献
2.
A priority queue transforms an input permutation of some set of sizen into an output permutation. It is shown that the number of such pairs (, ) is (n + 1)
n–1. Some related enumerative and algorithmic questions are also considered.Supported by the National Science and Engineering Research Council of Canada under Grant A4219. 相似文献
3.
Jongho?Bae Jongwoo?Kim Eui Yong?LeeEmail author 《Mathematical Methods of Operations Research》2003,58(3):477-482
We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.This work was supported by Korea Research Foundation Grant(KRF-2002-070-C00021). 相似文献
4.
In this paper, we show that the discrete GI/G/1 system can be easily analysed as a QBD process with infinite blocks by using the elapsed time approach in conjunction with the Matrix-geometric approach. The positive recurrence of the resulting Markov chain is more easily established when compared with the remaining time approach. The G-measure associated with this Markov chain has a special structure which is usefully exploited. Most importantly, we show that this approach can be extended to the analysis of the GI
X
/G/1 system. We also obtain the distributions of the queue length, busy period and waiting times under the FIFO rule. Exact results, based on computational approach, are obtained for the cases of input parameters with finite support – these situations are more commonly encountered in practical problems. 相似文献
5.
We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies. 相似文献
6.
We study a multi-server M/M/c type queue with a single vacation policy for some idle servers. In this queueing system, if at a service completion instant, any d (d c) servers become idle, these d servers will take one and only one vacation together. During the vacation of d servers, the other c–d servers do not take vacation even if they are idle. Using a quasi-birth-and-death process and the matrix analytic method, we obtain the stationary distribution of the system. Conditional stochastic decomposition properties have been established for the waiting time and the queue length given that all servers are busy. 相似文献
7.
本是[1,2]的继续,在本中利用马氏骨架过程给出了GI/G/1排队系统的队长的瞬时分布的另一新的计算方法和等待时间的计算方法。 相似文献
8.
We study the vessel arrival process in bulk ports handling either cargo containers or minerals. Then we introduce the SHIP/G/1 queue to be able to study the queueing behavior at the port. We present approximations for the asymptotic probabilities of delay and the number of vessels at the port. Numerical examples show the accuracy of the approximations. In appendices, we provide details of the analysis of the number of vessels at the port and the correlation properties of the vessel arrival process. 相似文献
9.
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. 相似文献
10.