全文获取类型
收费全文 | 400篇 |
免费 | 22篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 10篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 59篇 |
2012年 | 4篇 |
2011年 | 8篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 11篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 14篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
排序方式: 共有422条查询结果,搜索用时 15 毫秒
171.
In this note the authors call for a change of the optimality criteria given by Theorem 3 in section 5 of the paper of W. Szwarc “On Some Sequencing Problems” in NRLQ Vol. 15, No. 2 [2]. Further, two cases of the three machine problem, namely, (i) ≦ and (ii) ≦ are considered, and procedures for obtaining optimal sequences in these cases are given. In these cases the three-machine problem is solved by solving n (the number of jobs) two-machine problems. 相似文献
172.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献
173.
K.-H. Waldmann 《海军后勤学研究》1986,33(3):399-412
Simple criteria are found for reducing the computational effort in multistage Bayesian acceptance sampling. Regions of optimality are given for both terminal actions accept and reject. Also, criteria are presented for detecting nonoptimality of sets of sample sizes. Finally, nearly optimal (z,c?,c+)-sampling plans are constructed by restricting attention to a small subset of sample sizes. 相似文献
174.
175.
A method of life testing is proposed which combines both ordinary and accelerated life-testing procedures. It is assumed that an item can be tested either in a standard environment or under stress. The amount of stress is fixed in advance and is the same for all items to be tested However, the time x at which an item on lest is taken out of the standard environment and put under stress can be chosen by the experimenter subject to a given cost structure. When an item is put under stress its lifetime is changed by the factor α. Let the random variable T denote the lifetime of an item in the standard environment, and let γ denote its lifetime under the partially accelerated test procedure just described. Then Y = T if T ≦ x, and Y = x + α (T > x) if T > x. It is assumed that T has an exponential distribution with parameter θ. The estimation of θ and α and the optimal design of a partially accelerated life test are studied in the framework of Bayesian decision theory. 相似文献
176.
K. V. Ramani 《海军后勤学研究》1979,26(2):237-247
Independent samples are taken from C multivariate populations with continuous but unknown cumulative distribution function c.d.f.). The problem is to test the hypothesis that the C population c.d.f's are identical to a specified c.d.f. We approach this problem by first transforming the data so that the hypothesis being tested is that the common distribution is uniform over a unit hypercube. We then construct some Bayes tests and investigate their asymptotic properties. These tests are based on the asymptotic normality of the number of observations falling in the “asymptotically sufficient groupings”. 相似文献
177.
An algorithm for calculating the probabilities of a summed multinomial density function which is recursive with n (the number of trials) is presented. Having application in inspector error models for auditing and quality control problems with Cartesian product structures, the algorithm is discussed in the context of computing optimal economic sampling plans. Computational experience with the algorithm is presented. 相似文献
178.
K. D. Glazebrook 《海军后勤学研究》1980,27(1):123-130
A collection of jobs is to be processed by a single machine. Each job has a cost function associated with it which may be either linear or exponential, costs accruing when a job is completed. The machine may be allocated to the jobs according to a precedence relation. The problem is to find a strategy for allocating the machine which minimizes the total cost and which is consistent with the precedence relation. The paper extends and simplifies some previous work done by Sidney. 相似文献
179.
George R. Fitzpatrick Jerome Bracken Mary J. O'brien Lee G. Wentling Justin C. Whiton 《海军后勤学研究》1967,14(2):241-255
A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used. 相似文献
180.