全文获取类型
收费全文 | 564篇 |
免费 | 14篇 |
出版年
2019年 | 12篇 |
2017年 | 17篇 |
2016年 | 11篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 109篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 11篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 9篇 |
2004年 | 11篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 14篇 |
1988年 | 14篇 |
1987年 | 15篇 |
1986年 | 16篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1973年 | 7篇 |
1972年 | 9篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有578条查询结果,搜索用时 31 毫秒
511.
512.
Behram J. Hansotia 《海军后勤学研究》1980,27(2):257-272
We consider here stochastic linear programs with simple recourse when all the elements of the technology matrix and the resource vector have certain specific distributions. The distributions considered are the Normal, Exponential and Erlang. For the first two instances we extend the equivalent deterministic program to include the variance of the recourse. Finally, a simple example is given to illustrate the application of the formulas for the Erlang case. 相似文献
513.
This paper discusses situations in which the distribution of a lifetime response variable T is taken to depend upon a vector x of regressor variables. We specifically consider the case in which T, given x , has an exponential distribution, and in which x represents levels of fixed factors in an experimental design. Methods of analyzing data under this type of model are discussed, with maximum likelihood and least squares methods being presented and compared. 相似文献
514.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献
515.
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. 相似文献
516.
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. 相似文献
517.
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. 相似文献
518.
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. 相似文献
519.
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. 相似文献
520.
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. 相似文献