全文获取类型
收费全文 | 783篇 |
免费 | 21篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 20篇 |
2018年 | 10篇 |
2017年 | 20篇 |
2016年 | 14篇 |
2015年 | 14篇 |
2014年 | 21篇 |
2013年 | 150篇 |
2012年 | 8篇 |
2011年 | 6篇 |
2010年 | 13篇 |
2009年 | 11篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 6篇 |
2002年 | 15篇 |
2000年 | 8篇 |
1999年 | 10篇 |
1998年 | 17篇 |
1997年 | 13篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 21篇 |
1993年 | 22篇 |
1992年 | 13篇 |
1991年 | 20篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 20篇 |
1987年 | 18篇 |
1986年 | 20篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 12篇 |
1981年 | 12篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 15篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 11篇 |
1973年 | 11篇 |
1972年 | 12篇 |
1970年 | 9篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 8篇 |
排序方式: 共有805条查询结果,搜索用时 15 毫秒
91.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
92.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
93.
A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included. 相似文献
94.
The calculation of the exact reliability of complex systems is a difficult and tedious task. Consequently simple approximating techniques have great practical value. The hazard transform of a system is an invertible transformation of its reliability function which is convenient and useful in both applied and theoretical reliability work. A simple calculus for finding an approximate hazard transform for systems formed by series and parallel combinations of components is extended so that it can be used for any coherent system. The extended calculus is shown to lead to conservative approximations. A first order version of the extended calculus is also discussed. This method of approximation is even more simple to use, but is not always conservative. Examples of its application indicate that it is capable of giving quite accurate results. 相似文献
95.
Alan J. Kaplan 《海军后勤学研究》1973,20(2):231-239
Multi-depot supply systems are subject to stock distribution imbalances; i. e., the fraction of total system stock located at a depot may be too small to support the fraction of system demand expected to be placed on it. In the supply system of concern, a cutomer is always satisfied if there is stock anywhere in the system. Stock redistributions to correct imbalances may reduce both transportation costs and customer waiting times. A model for determining optimum redistribution quantities is formulated, and a practical method of solution for the two depot case is described. Selected numerical illustrations are given. 相似文献
96.
Charles H. Heider 《海军后勤学研究》1973,20(4):699-724
The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer-aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question- how close to optimal are the near optimal solutions- is examined. 相似文献
97.
Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998 相似文献
98.
99.
H. W. Kuhn 《海军后勤学研究》2005,52(1):7-21
This paper has been presented with the Best Paper Award. It will appear in print in Volume 52, No. 1, February 2005. 相似文献
100.