全文获取类型
收费全文 | 794篇 |
免费 | 12篇 |
出版年
2021年 | 14篇 |
2019年 | 11篇 |
2017年 | 18篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 16篇 |
2013年 | 120篇 |
2012年 | 23篇 |
2011年 | 28篇 |
2010年 | 23篇 |
2009年 | 14篇 |
2008年 | 31篇 |
2007年 | 17篇 |
2006年 | 19篇 |
2005年 | 9篇 |
2002年 | 8篇 |
2001年 | 9篇 |
1999年 | 5篇 |
1998年 | 13篇 |
1997年 | 14篇 |
1996年 | 6篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 16篇 |
1986年 | 23篇 |
1985年 | 16篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 14篇 |
1980年 | 12篇 |
1979年 | 20篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 8篇 |
1975年 | 15篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 18篇 |
1971年 | 7篇 |
1970年 | 7篇 |
1969年 | 14篇 |
1968年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有806条查询结果,搜索用时 0 毫秒
721.
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. 相似文献
722.
P. S. Dwyer 《海军后勤学研究》1974,21(3):445-464
This paper is designed to treat (a) the problem of the determination of the absolute minimum cost, with the associated assignments, when there is no limit, N, on the number of parcels available for shipment in a modified Hitchcock problem. This is accomplished with the use of a transformed cost matrix. C*, to which the so-called transportation paradox does not apply. The general Hitchcock solution using C* gives the cost T*, which is the absolute minimum cost of the original problem, as well as sets of assignments which are readily transformed to give the general assignments of the original problem. The sum of these latter assignments gives the value of Nu, the unbounded N for minimum cost. In addition, this paper is designed to show (b) how the method of reduced matrices may be used, (c) how a particular Hitchcock solution can be used to determine a general solution so that one solution using C* can provide the general answer, (d) how the results may be modified to apply to problems with fixed N, and hence (e) to determine the function of the decreasing T as N approaches Nu, and finally (f) to provide a treatment when the supplies at origin i and/or the demands at destination j, are bounded. 相似文献
723.
In this paper we have applied the mathematical control theory to the accounting network flows, where the flow rates are constrained by linear inequalities. The optimal control policy is of the “generalized bang-bang” variety which is obtained by solving at each instant in time a linear programming problem whose objective function parameters are determined by the “switching function” which is derived from the Hamiltonian function. The interpretation of the adjoint variables of the control problem and the dual evaluators of the linear programming problem demonstrates an interesting interaction of the cross section phase of the problem, which is characterized by linear programming, and the dynamic phase of the problem, which is characterized by control theory. 相似文献
724.
This paper considers sequential test procedures to decision problems where there exists time delays in obtaining observations. 相似文献
725.
Although the strategic airlift system is under continuous analysis, C-5A problems provided impetus to analyze the airlift system productivity function by using a large-scale simulation model. Development of the simulation model (Simulation of Airlift Resources - SOAR) was initiated by the Office of Secretary of Defense (Systems Analysis) in 1966. SOAR had barely become operational in time for the study in November 1968. Since limited verification and validation tests had been performed on the simulation model, the design of experiments was of critical importance. The experimental design had to be flexible enough to salvage the maximum amount of information possible upon the discovery of either a verification or validation error. In addition, the experimental design was required to accommodate the estimation of a large number of possibly changing independent variables. The experimental design developed for the analysis was full factorial design sets for a finite number of factors. Initial analysis began with aggregated sets of factors at two levels, and information gained from experiment execution was used to parse the sets. The process was sequential and parsing continued until the major explanatory independent variables were identified or enough information was obtained to eliminate the factor from further direct analysis. This design permitted the overlapping of simulation runs to fill out the factorial design sets. In addition to estimating the airlift productivity function, several other findings are reported which tended to disprove previous assumptions about the nature of the strategic airlift system. 相似文献
726.
This paper develops estimates of true volunteer levels for 1972 and 1973, based on experience gained through 1970 draft lottery data. The paper also formulates estimates of the qualitative characteristics of a 1972-1973 Navy volunteer force, and establishes a relationship between rate of volunteerism and military pay. Utilizing estimates generated in the paper, Navy military personnel budget requirements for FY '72 and '73 are presented. 相似文献
727.
728.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators. 相似文献
729.
One approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented. 相似文献
730.
J. L. Brenner 《海军后勤学研究》1969,16(3):359-379
The chief problems considered are: (1) In a parallel set of warehouses, how should stocks be allocated? (2) In a system consisting of a central warehouse and several subsidiary warehouses, how much stock should be carried in each? The demands may have known, or unknown, distribution functions. For problem (1), the i-th stock ni should usually be allocated in proportion to the i-th demand mi; in special cases, a significant improvement is embodied in the formula (N = total allocable stock)