全文获取类型
收费全文 | 197篇 |
免费 | 0篇 |
专业分类
197篇 |
出版年
2023年 | 2篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 46篇 |
2011年 | 1篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 1篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 3篇 |
1972年 | 2篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 3篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有197条查询结果,搜索用时 15 毫秒
61.
62.
63.
64.
65.
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. 相似文献
66.
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. 相似文献
67.
The problem of computing reliability and availability and their associated confidence limits for multi-component systems has appeared often in the literature. This problem arises where some or all of the component reliabilities and availabilities are statistical estimates (random variables) from test and other data. The problem of computing confidence limits has generally been considered difficult and treated only on a case-by-case basis. This paper deals with Bayes confidence limits on reliability and availability for a more general class of systems than previously considered including, as special cases, series-parallel and standby systems applications. The posterior distributions obtained are exact in theory and their numerical evaluation is limited only by computing resources, data representation and round-off in calculations. This paper collects and generalizes previous results of the authors and others. The methods presented in this paper apply both to reliability and availability analysis. The conceptual development requires only that system reliability or availability be probabilities defined in terms acceptable for a particular application. The emphasis is on Bayes Analysis and the determination of the posterior distribution functions. Having these, the calculation of point estimates and confidence limits is routine. This paper includes several examples of estimating system reliability and confidence limits based on observed component test data. Also included is an example of the numerical procedure for computing Bayes confidence limits for the reliability of a system consisting of N failure independent components connected in series. Both an exact and a new approximate numerical procedure for computing point and interval estimates of reliability are presented. A comparison is made of the results obtained from the two procedures. It is shown that the approximation is entirely sufficient for most reliability engineering analysis. 相似文献
68.
Robert F. Love 《海军后勤学研究》1969,16(4):503-516
We consider the problem of simultaneously locating any number of facilities in three-dimensional Euclidean space. The criterion to be satisfied is that of minimizing the total cost of some activity between the facilities to be located and any number of fixed locations. Any amount of activity may be present between any pair of the facilities themselves. The total cost is assumed to be a linear function of the inter-facility and facility-to-fixed locations distances. Since the total cost function for this problem is convex, a unique optimal solution exists. Certain discontinuities are shown to exist in the derivatives of the total cost function which previously has prevented the successful use of gradient computing methods for locating optimal solutions. This article demonstrates the use of a created function which possesses all the necessary properties for ensuring the convergence of first order gradient techniques and is itself uniformly convergent to the actual objective function. Use of the fitted function and the dual problem in the case of constrained problems enables solutions to be determined within any predetermined degree of accuracy. Some computation results are given for both constrained and unconstrained problems. 相似文献
69.
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. 相似文献
70.
Robert Roeloffs 《海军后勤学研究》1967,14(4):461-471
An analysis is made of the problem of finding optimal schedules for checking an operating unit subject to random failure detectable only by inspection of the unit. It is assumed that only partial information, in the form of .a single percentile of the otherwise unknown life distribution of the unit, is available. In a previous paper [5] some results were given for the case with a finite time horizon. Tn this work it is assumed that tne unit is replaceable at will with a new, statistically identical unit, and the horizon is infinite. 相似文献