全文获取类型
收费全文 | 736篇 |
免费 | 14篇 |
出版年
2019年 | 14篇 |
2018年 | 6篇 |
2017年 | 21篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 16篇 |
2013年 | 148篇 |
2012年 | 6篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 13篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 13篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1999年 | 9篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 11篇 |
1995年 | 10篇 |
1994年 | 19篇 |
1993年 | 18篇 |
1992年 | 12篇 |
1991年 | 20篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 21篇 |
1986年 | 20篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1981年 | 11篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 13篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 12篇 |
1973年 | 10篇 |
1972年 | 10篇 |
1970年 | 10篇 |
1969年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有750条查询结果,搜索用时 187 毫秒
141.
A series of independent trials is considered in which one of k ≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to the k vector of probabilities for each outcome. Applications to series of races involving k runners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcome i is k?1 (i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem are addressed. 相似文献
142.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods. 相似文献
143.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
144.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed. 相似文献
145.
Bernard J. McCabe 《海军后勤学研究》1974,21(4):673-682
In any model for a sonar detection process, some assumption must be made about the nature of the acoustic fluctuation process. Two processes that are widely used in this role are the jump process and the Gauss-Markov process. These processes are similar in that they are both stationer) Markov processes and have autocovariance functions of the form s?2exp(—γt). For these reasons, it might be believed that one could use either of these processes and get comparable results if all one is interested in is computing cumulative detection probabilities or mean time to gain or lose contact. However, such is not the case in that vastly different results can be obtained in some applications. An application of this sort is presented. We also present necessary and sufficient conditions for a threshold to have the property that it is almost surely crossed by the jump process, or by the Gauss-Markov process. This affords another method of comparison. 相似文献
146.
Robert R. Trippi 《海军后勤学研究》1974,21(2):327-332
A framework is developed for analyzing the likelihood of acceptance of an investment project proposal when objectives are uncertain. The foundation is a utility model of top management's choice process, modified if need be through a Bayesian approach which takes into account any apparent inconsistency in the history of past proposal acceptances and rejections. 相似文献
147.
The present paper extends the results of [7] to cases of multistation lower echelon. For this purpose an algorithm for the optimal allocation of the upper echelon stock among the lower echelon stations is developed. The policy of ordering for the upper echelon is an extension of the Bayes prediction policy developed in [7]. Explicit formulae are presented for the execution of this policy. Several simulation runs are presented and analyzed for the purpose of obtaining information on the behavior of the system, under the above control policy, over short and long periods. 相似文献
148.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
149.
The first problem considered in this paper is concerned with the assembly of independent components into parallel systems so as to maximize the expected number of systems that perform satisfactorily. Associated with each component is a probability of it performing successfully. It is shown that an optimal assembly is obtained if the reliability of each assembled system can be made equal. If such equality is not attainable, then bounds are given so that the maximum expected number of systems that perform satisfactorily will lie within these stated bounds; the bounds being a function of an arbitrarily chosen assembly. An improvement algorithm is also presented. A second problem treated is concerned with the optimal design of a system. Instead of assembling given units, there is an opportunity to “control” their quality, i.e., the manufacturer is able to fix the probability, p, of a unit performing successfully. However, his resources, are limited so that a constraint is imposed on these probabilities. For (1) series systems, (2) parallel systems, and (3) k out of n systems, results are obtained for finding the optimal p's which maximize the reliability of a single system, and which maximize the expected number of systems that perform satisfactorily out of a total assembly of J systems. 相似文献
150.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail. 相似文献