全文获取类型
收费全文 | 638篇 |
免费 | 13篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 16篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2014年 | 12篇 |
2013年 | 153篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 19篇 |
1996年 | 11篇 |
1994年 | 13篇 |
1992年 | 7篇 |
1991年 | 16篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 7篇 |
1971年 | 7篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有651条查询结果,搜索用时 15 毫秒
461.
462.
From an original motivation in quantitative inventory modeling, we develop methods for testing the hypothesis that the service times of an M/G/1 queue are exponentially distributed, given a sequence of observations of customer line and/or system waits. The approaches are mostly extensions of the well-known exponential goodness-of-fit test popularized by Gnedenko, which results from the observation that the sum of a random exponential sample is Erlang distributed and thus that the quotient of two independent exponential sample means is F distributed. 相似文献
463.
Consider a system consisting of n separately maintained independent components where the components alternate between intervals in which they are “up” and in which they are “down”. When the ith component goes up [down] then, independent of the past, it remains up [down] for a random length of time, having distribution Fi[Gi], and then goes down [up]. We say that component i is failed at time t if it has been “down” at all time points s ?[t-A.t]: otherwise it is said to be working. Thus, a component is failed if it is down and has been down for the previous A time units. Assuming that all components initially start “up,” let T denote the first time they are all failed, at which point we say the system is failed. We obtain the moment-generating function of T when n = l, for general F and G, thus generalizing previous results which assumed that at least one of these distributions be exponential. In addition, we present a condition under which T is an NBU (new better than used) random variable. Finally we assume that all the up and down distributions Fi and Gi i = l,….n, are exponential, and we obtain an exact expression for E(T) for general n; in addition we obtain bounds for all higher moments of T by showing that T is NBU. 相似文献
464.
465.
466.
467.
Carl M. Harris 《海军后勤学研究》1967,14(2):231-239
This paper explores a modification of the output discipline for the Poisson input, exponential output, single channel, first-come, first-served queueing system. Instead, the service time distribution of customers beginning service when alone in the system is considered different from that governing service times of all other customers. More specifically, the service times of lone customers are governed by a one parameter gamma distribution, while the service times of all other customers are exponentially ajstributed. The generating function for the steady-state probsbilities, nj = Pr { j customers in system at an arbitrary point of departure}, of the imbedded chain, {Xn/Xn = number in system after nth customer is serviced}, is obtained, and the steady-state probabilities, themselves, are found in closed form. 相似文献
468.
Carl M. Harris 《海军后勤学研究》1967,14(2):219-230
The purpose of this paper is to explore an extension of the output discipline for the Poisson input, general output, single channel, first-come, first-served queueing system. The service time parameter, μ, is instead considered a random variable, M. In other words, the service time random variable, T, is to be conditioned by a parameter random variable, M. Therefore, if the distribution function of M is denoted by FM(μ) and the known conditional service time distribution as B(t |μ), then the unconditional service distribution is given by B(t) = Pr {T ≤ t}. = ∫-∞∞ B(t |μ) dFM(μ). Results are obtained that characterize queue size and waiting time using the imbedded Markov chain approach. Expressions are derived for the expected queue length and Laplace-Stieltjes transforms of the steady-state waiting time when conditional service times are exponential. More specific results are found for three special distributions of M: (1) uniform on [1.2]; (2) two-point; and (3) gamma. 相似文献
469.
Paul S. Dwyer 《海军后勤学研究》1966,13(3):289-313
This paper shows how completely reduced matrices can be used in obtaining exact or approximate solutions to transportation problems with fixed charges. It does not treat methods for obtaining reduced matrices, which are available elsewhere, but it does discuss the problem of obtaining a completely reduced matrix, and then a general parametric solution to the primal problem, from any particular solution. Methods for obtaining particular solutions with determinacies of maximum order (solutions for the constant fixed charges problem) are then presented. The paper terminates with a discussion of methods which are useful in obtaining approximations to solutions of fixed charges problems with charges not constant. 相似文献
470.
This paper presents a statistical decision analysis of a one-stage linear programming problem with deterministic constraints and stochastic criterion function. Procedures for obtaining numerical results are given which are applicable to any problem having this general form. We begin by stating the statistical decision problems to be considered, and then discuss the expected value of perfect information and the expected value of sample information. In obtaining these quantities, use is made of the distribution of the optimal value of the linear programming problem with stochastic criterion function, and so we discuss Monte Carlo and numerical integration procedures for estimating the mean of this distribution. The case in which the random criterion vector has a multivariate Normal distribution is discussed separately, and more detailed methods are offered. We discuss dual problems, including some relationships of this work with other work in probabilistic linear programming. An example is given in Appendix A showing application of the methods to a sample problem. In Appendix B we consider the accuracy of a procedure for approximating the expected value of information. 相似文献