全文获取类型
收费全文 | 440篇 |
免费 | 15篇 |
国内免费 | 1篇 |
出版年
2021年 | 10篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2014年 | 10篇 |
2013年 | 70篇 |
2012年 | 6篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1973年 | 8篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有456条查询结果,搜索用时 15 毫秒
111.
Charles H. Falkner 《海军后勤学研究》1969,16(3):287-295
A mathematical model is formulated for determining the number of spare components to purchase when components stochastically fail according to a known life distribution function and there is a cost incurred when a component is replaced. Bounds are determined for the optimal inventory which indicate that the inclusion of the replacement cost lowers the optimal inventory. Since these bounds are no easier to calculate than the optimal spares level, the theory is specialized to components with exponentially distributed time to failure. Procedures are given for calculating the optimal spares level, and numerical examples are provided. 相似文献
112.
113.
114.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献
115.
Suppose a given set of jobs has to be processed on a multi-purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence-dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large-dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach. 相似文献
116.
The present study is concerned with the determination of a few observations from a sufficiently large complete or censored sample from the extreme value distribution with location and scale parameters μ and σ, respectively, such that the asymptotically best linear unbiased estimators (ABLUE) of the parameters in Ref. [24] yield high efficiencies among other choices of the same number of observations. (All efficiencies considered are relative to the Cramér-Rao lower bounds for regular unbiased estimators.) The study is on the asymptotic theory and under Type II censoring scheme. For the estimation of μ when σ is known, it has been proved that there exists a unique optimum spacing whether the sample is complete, right censored, left censored, or doubly censored. Several tables are prepared to aid in the numerical computation of the estimates as well as to furnish their efficiencies. For the estimation of σ when μ is known, it has been observed that there does not exist a unique optimum spacing. Accordingly we have obtained a spacing based on a complete sample which yields high efficiency. A similar table as above is prepared. When both μ and σ are unknown, we have considered four different spacings based on a complete sample and chosen the one yielding highest efficiency. A table of the efficiencies is also prepared. Finally we apply the above results for the estimation of the scale and/or shape parameters of the Weibull distribution. 相似文献
117.
Although cycling in the simplex method has long been known, a number of theoretical questions concerning cycling have not been fully answered. One of these, stated in [3], is to find the smallest example of cycling, and Beale's example with three equations and seven variables is conjectured to be the smallest one. The exact bounds on dimensions of cycling examples are established in this paper. We show that Beale's example is the smallest one which cycles at a non-optimal solution, that a smaller one can cycle at the optimum, and that, in general (including the completely degenerate case), a cycling example must have at least two equations, at least six variables, and at least three non-basic variables. Examples and geometries are given for the extreme cases, showing that the bounds are sharp. 相似文献
118.
119.
Soung H. Kim 《海军后勤学研究》1985,32(4):647-651
The Markov assumption that transition probabilities are assumed to be constant over entire periods has been applied in economic and social structures, for example, in the analysis of income and wage distributions. In many cases, however, nonstationary transition probabilities exist over different periods. Based on causative matrix technique, this study shows a binomial approximation for obtaining nonstationary interim transition probabilities under undisturbance when the first and the last transition matrices are known. 相似文献
120.