全文获取类型
收费全文 | 510篇 |
免费 | 13篇 |
出版年
2021年 | 11篇 |
2019年 | 21篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 11篇 |
2015年 | 12篇 |
2014年 | 9篇 |
2013年 | 101篇 |
2009年 | 5篇 |
2008年 | 6篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 16篇 |
1996年 | 8篇 |
1994年 | 10篇 |
1992年 | 4篇 |
1991年 | 14篇 |
1990年 | 5篇 |
1989年 | 11篇 |
1988年 | 8篇 |
1987年 | 16篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 6篇 |
1968年 | 6篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有523条查询结果,搜索用时 31 毫秒
461.
This article proposes a practical, data-based statistical procedure which can be used to reduce or remove bias owing to artificial startup conditions in simulations aimed at estimating steady-state means. We discuss results of experiments designed to choose good parameter values for this procedure, and present results of extensive testing of the procedure on a variety of stochastic models for which partial analytical results are available. The article closes with two illustrations of the application of the procedure to more complex statistical problems which are more representative of the kinds of purposes for which real-world steady-state simulation studies might be undertaken. 相似文献
462.
James A. M. McHugh 《海军后勤学研究》1984,31(3):409-411
This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available. 相似文献
463.
Tuncel M. Yegulalp 《海军后勤学研究》1975,22(4):697-712
This paper introduces a special control chart procedure for exponentially distributed product life. Statistical control of product life in manufacturing requires continuing life tests of manufactured product so as to detect changes in product life and take appropriate corrective action. These life testing experiments may become exceedingly time consuming and thus can be both impractical because of serious time delays in implementing corrective action on the process when indicated, and quite uneconomical. It is desirable to inquire into the character of life testing by means of a control chart procedure based on the real time to first failure within given samples. Measuring the real minimum life provides a considerable reduction in duration of the testing procedure and in the number of specimens destroyed, yielding a considerable economy over the Shewhart's X control chart. 相似文献
464.
Detailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other ways This paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron- Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible cases. 相似文献
465.
466.
Gary M. Roodman 《海军后勤学研究》1974,21(4):595-607
This paper develops a method for doing postoptimality analysis on the mixed integer programming problem. The proposed procedures form a natural adjunct to enumerative I.P. algorithms that are linear programming based, and they are designed, in effect, to capitalize on insights generated as the problem is initially solved to do subsequent analysis upon it. In particular, limited ranging analysis is possible on selected parameters, as is the efficient resolving of the problem following parameter changes. 相似文献
467.
This paper investigates the problem of choosing between two simple hypothesis, H0 and H1, in terms of independent, identically distributed random variables, when observations can be taken in groups. At any stage in the decision process it must be decided whether to stop and take action now or to continue, in which case the size of the next group of observations must be decided upon. The problem is to find an optimal procedure incorporating a stopping, group size (batch) and terminal action rule. It is proven, in general, that the optimal stopping and terminal action rule is of the sequential probability ratio type (SPRT). Fixed stopping rules of the SPRT type are studied and an iterative procedure of the policy improvement type, both with and without a value determination step, is developed. It is shown, for the general situation, that both the average risk and scheduling rule converge to the optima. Also, six suboptimal scheduling rules are considered with respect to the average risks they achieve. Numerical results are presented to illustrate the effectiveness of the procedures. 相似文献
468.
469.
Work by the present authors on life distributions derived from stochastic hazard functions [4] is related to certain articles that have appeared in this journal. This relationship is illustrated. The emphasis of this article is upon problems of parameter estimation. 相似文献
470.
A branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least-cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made. 相似文献