全文获取类型
收费全文 | 341篇 |
免费 | 16篇 |
出版年
2021年 | 11篇 |
2020年 | 3篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 48篇 |
2011年 | 6篇 |
2010年 | 3篇 |
2009年 | 9篇 |
2007年 | 8篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1966年 | 2篇 |
1948年 | 2篇 |
排序方式: 共有357条查询结果,搜索用时 15 毫秒
241.
Vinod K. Sahney 《海军后勤学研究》1972,19(4):725-735
This paper discusses scheduling of data transmission when data can only be transmitted in one direction at a time. A common policy used is the so-called alternating priority policy. In this paper we select a more general class of policies named the {Si; O} policy. We show how to determine the optimal parameters of the {Si; O} policy for given system parameters. We also give a simple example to show that {Si; O} policy is, in fact, better then alternating priority policy. 相似文献
242.
T. U. Zahle 《海军后勤学研究》1971,18(2):283-293
To find the hit probability for a series of correlated shots is, with conventional methods, a very tedious job even for the simplest statistical distributions. Experimental data, however, commonly show the shots lying chain-like on smooth curves about the target. For this case this paper introduces a new method of finding the hit probability without the use of correlation coefficients. The method is based on a transformation, where the target is transformed into a point and each bullet into an area the size of the target. 相似文献
243.
There are a great number of queueing systems, including the MX/MY/c, the GlX/M/c and the discrete Gl/G/1 queue in which the state probabilities are determined by repeated queue equations. This paper gives a simple, efficient and numerically stable algorithm to caiculate the state probabilities and measure of performance for such systems. The method avoids both complex arithmetric and matrix manipulations. 相似文献
244.
K. H. Wickwire 《海军后勤学研究》1981,28(3):423-429
We investigate a class of optimal stopping problems for dynamical systems described by one-dimensional differential equations with an additive Poisson disturbance. The rate of the disturbance may depend upon the current state of the system. A dynamic programming equation for the optimal stopping cost is derived along with conditions which must be met at the boundary of the optimal stopping set. These boundary conditions depend upon whether or not the stopping set may be entered by smooth motion. 相似文献
245.
In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method. 相似文献
246.
In multi-commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two-commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K1, or K2, where max (K1, K2) ≤ K ≤ K1 + K2, This paper considers a two-commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering policies. 相似文献
247.
James K. Hartman 《海军后勤学研究》1973,20(3):569-576
When applied to a problem which has more than one local optimal solution, most nonlinear programming algorithms will terminate with the first local solution found. Several methods have been suggested for extending the search to find the global optimum of such a nonlinear program. In this report we present the results of some numerical experiments designed to compare the performance of various strategies for finding the global solution. 相似文献
248.
249.
We consider the problem of temporal expansion of the capacity of, say, a plant or road given estimates of its desired usage (demand). The basic problem is: given a sequence of predicted demands for N time periods, determine the optimal investment decision in each period to minimize a linear investment cost and a strictly convex cost of capacity. The relationship between capacity and the investment decisions is assumed to be linear, but time varying. Constraints on both the individual decisions and on the sum of the decisions are considered. An algorithm for solving this problem is derived. 相似文献
250.