首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   729篇
  免费   1篇
  730篇
  2019年   17篇
  2018年   12篇
  2017年   20篇
  2016年   13篇
  2015年   17篇
  2014年   20篇
  2013年   136篇
  2012年   7篇
  2011年   7篇
  2010年   9篇
  2009年   14篇
  2006年   8篇
  2005年   9篇
  2004年   13篇
  2003年   10篇
  2002年   11篇
  2001年   6篇
  2000年   11篇
  1999年   7篇
  1998年   13篇
  1997年   7篇
  1996年   9篇
  1995年   6篇
  1994年   17篇
  1993年   18篇
  1992年   10篇
  1991年   17篇
  1990年   12篇
  1989年   18篇
  1988年   20篇
  1987年   18篇
  1986年   20篇
  1985年   14篇
  1984年   9篇
  1983年   8篇
  1982年   7篇
  1981年   8篇
  1980年   7篇
  1979年   11篇
  1978年   13篇
  1976年   9篇
  1975年   8篇
  1974年   13篇
  1973年   9篇
  1972年   10篇
  1971年   7篇
  1970年   12篇
  1969年   10篇
  1968年   7篇
  1967年   6篇
排序方式: 共有730条查询结果,搜索用时 0 毫秒
431.
In this paper formulas are derived for the reliability of a single unit to which identical spares in standby are allocated, with all of these units having a hyper-exponential or Erlang distributed lifetime. Two advantages are obtained by using these distributions. First, the general procedure for calculating the effect of redundancy is applicable, in contrast with most of the common life distributions, such as Weibull. Moreover, both distributions are suitable for matching to observed curves and practical data by varying the values of the parameters, covering together most of the cases of practical interest.  相似文献   
432.
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n2m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems.  相似文献   
433.
To location Li we are to allocate a “generator” and ni “machines” for i = 1, …,k, where n1n1 ≧ … ≧ nk. Although the generators and machines function independently of one another, a machine is operable only if it and the generator at its location are functioning. The problem we consider is that of finding the arrangement or allocation optimizing the number of operable machines. We show that if the objective is to maximize the expected number of operable machines at some future time, then it is best to allocate the best generator and the n1 best machines to location L1, the second-best generator and the n2-next-best machines to location L2, etc. However, this arrangement is not always stochastically optimal. For the case of two generators we give a necessary and sufficient condition that this arrangement is stochastically best, and illustrate the result with several examples.  相似文献   
434.
435.
436.
437.
This work is concerned primarily with presenting techniques for constructing bimatrix games with predetermined equilibrium points. Some partial results on Nash-solvability are also given.  相似文献   
438.
The Tactical Warfare Simulation Program is a procedure by which the major interactions among opposing military units and terrain features can be treated in a tactical limited warfare situation. It is a critical-area, sequence-of-event model and is programmed in SIM-SCRIPT. In this program a military unit is described by such properties as strength, size, location, velocity, and attrition rates. Some of the events which can occur to a military unit are entering/leaving terrain features, becoming engaged/disengaged with opposing units, retreating, reaching an objective, and breaking. Following a discussion of the general features of the program, a study of a hypothetical war is presented.  相似文献   
439.
The paper consists essentially of two parts. In the first part a linear economic impact model is presented whose structure is based on subcontracting flows. The structural coefficients are defined in terms of flows per area. The model is derived from two identities that are analogous to the income and expenditure identities of national income accounting. The parameters are prime contracts and when one or several of the prime contracts are changed, the model determines the impacts of such changes on the various regions that have been selected. The impacts can be combined with regional multipliers to derive changes in regional income and regional employment. Fragmentary data for this kind of model have been collected on a one-time basis by DOD in 1965 and some results based on the data are presented. The second part of the paper is concerned with normative economics. A scheme is suggested, called compensated procurement, that outlines how the Department of Defense might employ the impact model in a macroeconomic setting. The basic idea is that a stabilization fund be established to finance an array of potential projects which are contracted for to balance sudden shifts in defense demand. Only short-run stabilization is advocated.  相似文献   
440.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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