首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   405篇
  免费   0篇
  405篇
  2021年   6篇
  2019年   7篇
  2018年   4篇
  2017年   3篇
  2016年   7篇
  2015年   2篇
  2014年   6篇
  2013年   69篇
  2012年   3篇
  2009年   4篇
  2007年   13篇
  2005年   2篇
  2004年   4篇
  2003年   8篇
  2002年   6篇
  2001年   2篇
  2000年   3篇
  1999年   4篇
  1998年   7篇
  1997年   8篇
  1996年   10篇
  1995年   3篇
  1994年   6篇
  1993年   10篇
  1992年   7篇
  1991年   9篇
  1990年   10篇
  1989年   18篇
  1988年   14篇
  1987年   8篇
  1986年   14篇
  1985年   8篇
  1984年   4篇
  1983年   3篇
  1982年   11篇
  1981年   6篇
  1980年   7篇
  1979年   10篇
  1978年   10篇
  1977年   6篇
  1976年   5篇
  1975年   5篇
  1974年   9篇
  1973年   5篇
  1972年   3篇
  1971年   7篇
  1970年   6篇
  1969年   5篇
  1967年   6篇
  1948年   4篇
排序方式: 共有405条查询结果,搜索用时 15 毫秒
241.
242.
Moment estimators for the parameters of the Weibull distribution are considered in the context of analysis of field data. The data available are aggregated, with individual failure times not recorded. In this case, the complexity of the likelihood function argues against the use of maximum-likelihood estimation, particularly for relatively large sets of data, and moment estimators are a reasonable alternative. In this article, we derive the asymptotic covariance matrix of the moment estimators, and provide listings for BASIC computer programs which generate tables useful for calculation of the estimates as well as for estimating the asymptotic covariance matrix using aggregated data.  相似文献   
243.
Book reviews     
Small Wars Manual. United States Marine Corps 1940, with introduction by Ronald Schaffer, Sunflower University Press, Manhattan, Kansas, (1990), ISBN: 0-89745-112-0.

Military Mindlessness: an Informal Compendium. Edited by Raymond Horricks. Transaction Publishers, New Brunswick and London, (1993), ISBN: 1-56000-105-4. Price $26.95

Sipri Yearbook 1993: World Armaments and Disarmament, Oxford University Press, Oxford, (1993) ISBN 0-19-829166-3 - Price £50.00

Nigeria: The Politics of Adjustment and Democracy. By Julius O. Ihonvbere. Transaction Publishers, London & New Brunswick (1994), ISBN 1-56000-093-7, Price £34.95  相似文献   
244.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc.  相似文献   
245.
This exposition presents a method for incorporating a technique known as “splitting the bump” within an elimination form reinversion algorithm. This procedure is designed to reduce fill-in during reinversion and should improve the efficiency of linear programming systems which already use the superior elimination form of the inverse.  相似文献   
246.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F.  相似文献   
247.
The bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum time Two algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally.  相似文献   
248.
249.
A “circulating system” is a finite collection of objects, each of which is oscillaling between two states. The prototype system is that of ships on patrcl,each subject to a quasi-regular “duty-service” cycle. There are various restrictions on the time spent in either state by an object and on the number of objects in a state at any one time. Schedules are sought in which the total number in one state is as large and as constant as possible. The maximal average number in one state is calculated, and a necessary and sufficient condition is given for a schedule to achieve it. Procedures are developed for constructing a schedule which achieves the maximal average in the most constant manner.  相似文献   
250.
The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号