全文获取类型
收费全文 | 286篇 |
免费 | 5篇 |
出版年
2021年 | 4篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 44篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 6篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有291条查询结果,搜索用时 0 毫秒
261.
Paul D. Berger 《海军后勤学研究》1972,19(1):159-164
This paper poses a prediction problem in which a linear model is assumed. With a “zero-one” loss structure as the loss from incorrect prediction, it is suggested that least squares may not be appropriate for estimating the parameters of the model. An alternate criterion is proposed and integer programming is used in order to find the estimates, given the proposed criterion. 相似文献
262.
One approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented. 相似文献
263.
264.
Under fairly general conditions, a nonlinear fractional program, where the function to be maximized has the form f(x)/g(x), is shown to be equivalent to a nonlinear program not involving fractions. The latter program is not generally a convex program, but there is often a convex program equivalent to it, to which the known algorithms for convex programming may be applied. An application to duality of a fractional program is discussed. 相似文献
265.
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. 相似文献
266.
267.
D. E. Matthews 《海军后勤学研究》1977,24(3):457-462
A simple method is presented for deriving the mean and variance of the queueing time distribution in an M/G/1 queue when the priorities assigned to customers have an assignment probability distribution. Several examples illustrate the results. The mean and variance of the queueing time distribution for the longest service time discipline are derived, and its disadvantages are discussed. 相似文献
268.
Ronald D. Armstrong 《海军后勤学研究》1977,24(4):619-625
This paper considers the problem of locating m new facilities in the plane so as to minimize a weighted rectangular distance between the new facilities and n existing facilities. A special purpose primal simplex algorithm is developed to solve this problem. The algorithm will maintain at all times a basis of dimension m by m; however, because of the triangularity of the basis matrix, it will not be necessary to form a basis inverse explicitly. 相似文献
269.
Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques. 相似文献
270.