首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   808篇
  免费   0篇
  808篇
  2021年   17篇
  2019年   26篇
  2018年   13篇
  2017年   13篇
  2016年   17篇
  2015年   13篇
  2014年   14篇
  2013年   145篇
  2008年   6篇
  2007年   16篇
  2006年   6篇
  2005年   9篇
  2004年   11篇
  2003年   12篇
  2002年   11篇
  2001年   6篇
  2000年   8篇
  1999年   6篇
  1998年   15篇
  1997年   19篇
  1996年   15篇
  1995年   6篇
  1994年   16篇
  1993年   12篇
  1992年   11篇
  1991年   19篇
  1990年   12篇
  1989年   21篇
  1988年   20篇
  1987年   20篇
  1986年   18篇
  1985年   11篇
  1984年   9篇
  1983年   11篇
  1982年   17篇
  1981年   9篇
  1980年   14篇
  1979年   16篇
  1978年   13篇
  1977年   13篇
  1976年   10篇
  1975年   9篇
  1974年   15篇
  1973年   14篇
  1972年   9篇
  1971年   12篇
  1970年   13篇
  1969年   11篇
  1968年   6篇
  1967年   11篇
排序方式: 共有808条查询结果,搜索用时 0 毫秒
211.
The Egyptian military's unconstitutional removal of President Mohamed Morsi has reignited a debate regarding the theory of the ‘democratic coup’. Though coups are almost invariably condemned, many political observers and a few scholars have recently argued that coups can act as catalysts for democratisation. This paper empirically assesses the democratic coup hypothesis for Africa. Multivariate analyses from 1952 to 2012 suggest that coups statistically improve a country's democratisation prospects. Extensions of the model show that coups appear to be likely precursors for democratisation in staunchly authoritarian regimes and have become less likely to end democracy over time, and that their positive influence has strengthened since the end of the Cold War. As of 2012, countries that have experienced a recent coup are expected to be four times more likely to witness a democratic transition than those that have remained coup-free.  相似文献   
212.
213.
214.
215.
This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level-crossing theory, and examples are given for various cases of service and vacation-time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc.  相似文献   
216.
This note points out the omission of a simple but vital constraint in the recent articles on partial backlogging. Also, a simple intuitive interpretation of the “backorder” inequality of [2], [3], and [4] is provided.  相似文献   
217.
In this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived.  相似文献   
218.
In this paper we analyze optimal search strategies in an environment in which multiple, independent targets arrive and depart at random. The analysis revolves around a continuous time differential equation model which captures the time dependent nature of the search process. We explore the impact on optimal strategies of nonzero travel times between regions as well as differing target arrival rates. We derive simple closed form expressions for determining if only one region should be searched.  相似文献   
219.
This paper pruvides a smaller equivalelnt bounded variable transportation problem than that in Charnes, Glover, and Klingman [1] for the lower bounded and partial upper bounded distribution model.  相似文献   
220.
This paper deals with the numerical problems arising in the computation of higher order moments of the busy period for certain classical queues of the M|G|I type, both in discrete and in continuous time The classical functional equation for the moment generating function of the busy period is used. The higher order derivatives at zero of the moment generating function are computed by repeated use of the classical differentiation formula of Fá di Bruno. Moments of order up to fifty may be computed in this manner A variety of computational aspects of Fá di Bruno's formula, which may be of use in other areas of application, are also discussed in detail.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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