全文获取类型
收费全文 | 561篇 |
免费 | 15篇 |
出版年
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 18篇 |
2018年 | 12篇 |
2017年 | 12篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 8篇 |
2013年 | 86篇 |
2010年 | 7篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2005年 | 5篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 10篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 6篇 |
1989年 | 16篇 |
1988年 | 18篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 13篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 15篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 8篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1972年 | 6篇 |
1971年 | 13篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 6篇 |
1967年 | 6篇 |
1966年 | 7篇 |
排序方式: 共有576条查询结果,搜索用时 15 毫秒
261.
A population of items which break down at random times and require repair is studied (the classic “machine repair problem with spares”). It is desired to determine the number of repair channels and spares required over a multiyear planning horizon in which population size and component reliability varies, and a service level constraint is imposed. When an item fails, a spare (if available) is immediately dispatched to replace the failed item. The failed item is removed, transported to the repair depot, repaired, and then placed in the spares pool (which is constrained to be empty not more than 10% of the time) unless there is a backlog of requests for spares, in which case it is dispatched immediately. The first model considered treats removal, transportation, and repair as one service operation. The second model is a series queue which allows for the separate treatment of removal, transportation, and repair. Breakdowns are assumed Poisson and repair times exponential. 相似文献
262.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献
263.
In this paper we examine the one- and two-sided sampling plans for the exponential distribution. Solutions are provided for several situations arising out of the assumptions on the knowledge of the parameters of the distribution. The values of the constants are tabled in the special case of p1 = p2 for the two-sided plans. 相似文献
264.
265.
266.
267.
268.
Michael D. Krause 《Defense & Security Analysis》1988,4(3):321-326
The Brain of an Army: a Popular Account of the German General Staff. By Spenser Wilkinson. Archibald Constable, London (1st edition 1890, 2nd edition 1895) 相似文献
269.
This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented. 相似文献
270.
The quadratic-assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch-and-bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented. 相似文献