全文获取类型
收费全文 | 197篇 |
免费 | 0篇 |
出版年
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 毫秒
181.
Initial provisioning decisions (inventory stocking requirements) for low demand items often have to be made without much knowledge of what future demand rates will be. When the nature of an item is such that little demand for it is expected, the problem of whether to stock initially or risk not stocking the item is most critical. This report discusses this problem and presents decision procedures which can be used to handle this aspect of initial provisioning. The procedures relate an item's provisioning desirability to its provisioning characteristics, such as expected cost, expected resupply time, current information on its likely demand rate, and to an overall operating policy or criterion. The criterion function measures the total system degredation as a function of the events of having items out of stock when demand occurs. Several different policy functions are discussed and the provisioning decision rules which apply to each are presented. Demand rate information is handled through a Bayesian type approach. The decision rules presented in this report can be utilized to either determine stocking requirements within a budgetary constraint, or determine the relative stocking desirability on an item-by-item basis. 相似文献
182.
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. 相似文献
183.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
184.
Robert A. Agnew 《海军后勤学研究》1982,29(2):291-302
Simple direct smoothing formulas are derived for updating coefficient estimates and forecasts in a discounted least squares model. These formulas are the natural extensions of R. G. Brown's well-known smoothing formulas to a general econometric setting with arbitrary explanatory time series. The recursive updating process and its forecast error properties are illustrated via a simple, yet realistic numerical example. 相似文献
185.
An approach is presented for obtaining the moments and distribution of the optimal value for a class of prototype stochastic geometric programs with log-normally distributed cost coefficients. It is assumed for each set of values taken on by the cost coefficients that the resulting deterministic primal program is superconsistent and soluble. It is also required that the corresponding dual program has a unique optimal point with all positive components. It is indicated how one can apply the results obtained under the above assumptions to stochastic programs whose corresponding deterministic dual programs need not satisfy the above-mentioned uniqueness and positivity requirements. 相似文献
186.
Robert C. Leachman 《海军后勤学研究》1983,30(2):187-198
The resource leveling problem for a construction system producing a stream of output units is considered. The system is modeled using a critical-path-analysis activity network, from which an extended network is developed for an integrated planning effort of all output units. Activity intensity variables are defined which measure activity demand rates for resources and consequent activity durations for the production of each output unit. A heuristic approach consisting of an iterative nonlinear programming procedure is presented which computes activity durations (intensities) for the minimization of resource capacity costs subject to meeting construction due dates. The application to a major ship overhaul project is described, in which the procedure was used to level workloads of the various labor–trade shops. 相似文献
187.
188.
We consider the stochastic linear knapsack problem in which costs are known with certainty but returns are independent, normally distributed random variables. The objective is to maximize the probability that the overall return equals or exceeds a specified target value. A previously proposed preference order dynamic programming-based algorithm has been shown to be potentially suboptimal. We offer an alternative hybrid DP/branch-and-bound algorithm that both guarantees optimality and significantly outperforms generating the set of Pareto optimal returns.© 1993 John Wiley & Sons, Inc. 相似文献
189.
190.