全文获取类型
收费全文 | 700篇 |
免费 | 15篇 |
专业分类
715篇 |
出版年
2021年 | 11篇 |
2020年 | 8篇 |
2019年 | 25篇 |
2018年 | 14篇 |
2017年 | 19篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 156篇 |
2011年 | 7篇 |
2009年 | 8篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2006年 | 7篇 |
2005年 | 12篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1998年 | 10篇 |
1997年 | 17篇 |
1996年 | 9篇 |
1995年 | 9篇 |
1994年 | 14篇 |
1992年 | 11篇 |
1991年 | 22篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 20篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 9篇 |
1975年 | 10篇 |
1974年 | 13篇 |
1973年 | 16篇 |
1972年 | 7篇 |
1971年 | 7篇 |
1970年 | 10篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 7篇 |
排序方式: 共有715条查询结果,搜索用时 15 毫秒
461.
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. 相似文献
462.
This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric. 相似文献
463.
Paul Meyer James 《海军后勤学研究》1968,15(4):595-604
Learning curves have been used extensively for predictive purposes in the airframe and other industries. In many instances this has led to erroneous results because analysts failed to extend learning curve theory and develop adequate analytical techniques in the turbulent regime of the cost history characterizing these industries. It is this area where a series of design changes induces a series of perturbations whose turbulence intensity is a function of the frequency of occurrence and magnitudes of the design changes under consideration. In Ref. 1, a series of formulations amenable to machine programming was developed for the accurate determination of perturbed unit costs. This development was based on additions of new learning having a constant slope. In this discussion, the development of Ref. 1 will be generalized by developing formulas for the addition of new effort having variable slopes. Consideration will also be given to the expressions involving elementary unit cost expressions so that cumulative average and cumulative total values can readily be obtained from existing experience curve tables. Conversely, the problem of determining the magnitudes of design changes and the slopes of new effort from graphical data will also be considered. 相似文献
464.
F. M. Scherer 《海军后勤学研究》1966,13(1):71-82
This paper explores the relationship between research project cost and expected time to completion under various scheduling strategies; it assumes that many potential technical approaches to the research problem can be identified; and that each approach has a low but finite subjective probability of success. It is shown that under a variety of assumptions, expected time to project completion can be reduced, but that as a result expected project cost rises at an increasing rate. Some cases in which this convex time-cost tradeoff relationship might not hold generally are identified. When the time-cost tradeoff function is convex, the desirability of concurrent as opposed to series scheduling of approaches depends crucially upon the depth of the stream of benefits expected to be realized upon successful project completion. The deeper the benefit stream is, the more desirable concurrent scheduling is. 相似文献
465.
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. 相似文献
466.
The bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum time Two algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally. 相似文献
467.
468.
Consider a single-server exponential queueing loss system in which the arrival and service rates alternate between the paris (γ1, γ1), and (γ2, μ2), spending an exponential amount of time with rate cμi in (γi, μi), i = 1.2. It is shown that if all arrivals finding the server busy are lost, then the percentage of arrivals lost is a decreasing function of c. This is in line with a general conjecture of Ross to the effect that the “more nonstationary” a Poisson arrival process is, the greater the average customer delay (in infinite capacity models) or the greater the precentage of lost customers (in finite capacity models). We also study the limiting cases when c approaches 0 or infinity. 相似文献
469.
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. 相似文献
470.
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. 相似文献