全文获取类型
收费全文 | 377篇 |
免费 | 9篇 |
出版年
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 7篇 |
2015年 | 5篇 |
2014年 | 4篇 |
2013年 | 57篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2005年 | 3篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 11篇 |
1990年 | 5篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 9篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 6篇 |
1972年 | 4篇 |
1971年 | 8篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 6篇 |
排序方式: 共有386条查询结果,搜索用时 34 毫秒
81.
Exact first and second order moments of order statistics from the truncated exponential distribution
Exact expressions for the first and second order moments of order statistics from the truncated exponential distribution, when the proportion 1–P of truncation is known in advance, are presented in this paper. Tables of expected values and variances-covariances are given for P = 0.5 (0.1) 0.9 and n = 1 (1) 10. 相似文献
82.
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. 相似文献
83.
Jatinder N. D. Gupta 《海军后勤学研究》1975,22(2):255-269
This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well-defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large-sized problems even with manual computational devices. 相似文献
84.
N. U. Prabhu 《海军后勤学研究》1974,21(3):411-418
Suppose that the state of a queueing system is described by a Markov process { Yt, t ≥ 0}, and the profit from operating it up to a time t is given by the function f(Yt). We operate the system up to a time T, where the random variable T is a stopping time for the process Yt. Optimal stochastic control is achieved by choosing the stopping time T that maximizes Ef(YT) over a given class of stopping times. In this paper a theory of stochastic control is developed for a single server queue with Poisson arrivals and general service times. 相似文献
85.
86.
Lawrence D. Stone 《海军后勤学研究》1973,20(3):419-430
This paper considers the problem of finding optimal solutions to a class of separable constrained extremal problems involving nonlinear functionals. The results are proved for rather general situations, but they may be easily stated for the case of search for a stationary object whose a priori location distribution is given by a density function on R, a subset of Euclidean n-space. The functional to be optimized in this case is the probability of detection and the constraint is on the amount of effort to be used Suppose that a search of the above type is conducted in such a manner as to produce the maximum increase in probability of detection for each increment of effort added to the search. Then under very weak assumptions, it is proven that this search will produce an optimal allocation of the total effort involved. Under some additional assumptions, it is shown that any amount of search effort may be allocated in an optimal fashion. 相似文献
87.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
88.
Richard N. Burns 《海军后勤学研究》1976,23(1):125-129
A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems. 相似文献
89.
N. Bhashyam 《海军后勤学研究》1970,17(1):121-129
This paper examines the effect of limitation, regarding weapons that are likely to fail during the period of deployment, on the final outcome in a stochastic duel model. Inter-firing times as well as inter-failure times have been assumed to be exponentially distributed. 相似文献
90.
This article deals with special cases of open-shop scheduling where n jobs have to be processed by m, m ?3, machines to minimize the schedule length. The main result obtained is an O(n) algorithm for the three-machine problem with a dominated machine. 相似文献