全文获取类型
收费全文 | 535篇 |
免费 | 13篇 |
出版年
2021年 | 10篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 14篇 |
2014年 | 13篇 |
2013年 | 99篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2003年 | 8篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 11篇 |
1988年 | 21篇 |
1987年 | 9篇 |
1986年 | 20篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 4篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 11篇 |
1974年 | 13篇 |
1973年 | 7篇 |
1972年 | 11篇 |
1971年 | 8篇 |
1970年 | 7篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1966年 | 4篇 |
排序方式: 共有548条查询结果,搜索用时 15 毫秒
111.
The present paper extends the results of [7] to cases of multistation lower echelon. For this purpose an algorithm for the optimal allocation of the upper echelon stock among the lower echelon stations is developed. The policy of ordering for the upper echelon is an extension of the Bayes prediction policy developed in [7]. Explicit formulae are presented for the execution of this policy. Several simulation runs are presented and analyzed for the purpose of obtaining information on the behavior of the system, under the above control policy, over short and long periods. 相似文献
112.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
113.
114.
Many optimization problems occur in both theory and practice when one has to optimize an objective function while an infinite number of constraints must be satisfied. The aim of this paper in to describe methods of handling such problems numerically in an effective manner. We also indicate a number of applications. 相似文献
115.
Many techniques of forecasting are based upon extrapolation from time series. While such techniques have useful applications, they entail strong assumptions which are not explicitly enunciated. Furthermore, the time series approach not based on an indigenous forecast principle. The first attack from the present point of view was initiated by S. S. Wilks. Of particular interest over a wide range of operational situations in reliability, for example, is the behavior of the extremes of the Weibull and Gumbel distributions. Here we formulate forecasters for the minima of various forms of these distributions. The forecasters are determined for minimization in mean square of the distance. From n original observations the forecaster provides the minimum of the next m observations when the original distribution is maintained. For each of the forecasters developed, tables of efficiency have been calculated and included in the appendix. An explicit example has been included for one of the forecasters. Its performance has been demonstrated by the use of Monte Carlo technique. The results indicate that the forecaster can be used in practice with satisfactory results. 相似文献
116.
The problem of selecting materials, their thicknesses and order for armor designed for the defeat of shaped charge threats, has been formulated as a constrained optimization problem. The mathematical model provides an optimal order and thickness of each layer of material such that the resulting armor configuration will be of minimum mass per unit area subject to constraints on total thickness and shaped charge jet tip exit velocity. 相似文献
117.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
118.
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix. 相似文献
119.
120.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献