全文获取类型
收费全文 | 729篇 |
免费 | 14篇 |
出版年
2020年 | 6篇 |
2019年 | 16篇 |
2017年 | 24篇 |
2016年 | 18篇 |
2015年 | 19篇 |
2014年 | 22篇 |
2013年 | 141篇 |
2012年 | 8篇 |
2011年 | 9篇 |
2010年 | 13篇 |
2009年 | 16篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 11篇 |
2004年 | 13篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 5篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 19篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 19篇 |
1987年 | 17篇 |
1986年 | 21篇 |
1985年 | 16篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 9篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有743条查询结果,搜索用时 15 毫秒
661.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献
662.
During basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump. 相似文献
663.
A definition of the problem of the initial transient with respect to the steady-state mean value has been formulated. A set of criteria has been set forth by which the efficaacy of any proposed rule may be assessed. Within this framework, five heuristic rules for predicting the approximate end of transiency, four of which have been quoted extensively in the simulation literature, have been evaluated in the M/M/1 situation. All performed poorly and are not suitable for their intended use. 相似文献
664.
M. J. Fischer 《海军后勤学研究》1978,25(4):667-679
In this paper, we consider the analysis of two M/G/1 queueing systems sharing the same finite waiting room. An exact analysis is given for several special cases, and then an algorithm is developed which approximates the system behavior for the general problem. Comparisons are made between the special cases and the algorithm. 相似文献
665.
With constant firing, metal fatigue produces cracks in a gun barrel. The useful life of the barrel comes to an end when a crack develops to a critical size. The theory of Fracture Mechanics suggests a formula for crack size growth rate. This formula can be used to determine the life of a barrel, depending on the initial and critical crack sizes and other factors. The initial crack size turns out to be a dominant factor. Unfortunately, accurate measurements are not generally available on the initial crack size. In this paper, we propose a simple probability model for the initial crack size and this, in turn, leads to a probability distribution of the life of the barrel. This last distribution is the well-known exponential distribution with a location shift. The simplicity of this final result is one of the factors that make the model appealing. 相似文献
666.
The stochastic duel is extended to include the possibility of a near-miss on each round fired, which causes the opponent to displace. During displacement, the displacing contestant cannot return the fire but is still a target for his opponent. An alternative interpretation of this model is to consider the displacement time as the time a contestant's fire is suppressed by his opponent's fire and that he does not move, but merely ceases fire temporarily. All times are exponentially distributed. 相似文献
667.
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. 相似文献
668.
This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions. 相似文献
669.
Peter J. Kolesar 《海军后勤学研究》1967,14(3):317-327
Several problems in the assignment of parallel redundant components to systems composed of elements subject to failure are considered. In each case the problem is to make an assignment which maximizes the system reliability subject to system constraints. Three distinct problems; are treated. The first is the classical problem of maximizing system reliability under total cost or weight constraints when components are subject to a single type of failure. The second problem deals with components which are subject to two types of failure and minimizes the probability of one mode of system failure subject to a constraint on the probability of the other mode of system failure. The third problem deals with components which may either fail to operate or may operate prematurely. System reliability is maximized subject to a constraint ori system safety. In each case the problem is formulated as an integer linear program. This has an advantage over alternative dynamic programming formulations in that standard algorithms may be employed to obtain numerical results. 相似文献
670.
This paper deals with the analysis of a model for studying the probability of survival of a subterranean target under an intensive attack. Most of the analysis is based on the assumption that the explosions are circularly distributed about the target and that the number of explosions is known. In the last two sections it is shown what effect a relaxation of these assumptions has on the probability of survival of the target. 相似文献