首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   590篇
  免费   18篇
  国内免费   1篇
  2021年   11篇
  2019年   17篇
  2018年   9篇
  2017年   13篇
  2016年   10篇
  2015年   12篇
  2014年   14篇
  2013年   107篇
  2010年   8篇
  2007年   9篇
  2006年   6篇
  2005年   10篇
  2004年   5篇
  2002年   12篇
  2001年   7篇
  2000年   6篇
  1999年   7篇
  1998年   13篇
  1997年   14篇
  1996年   8篇
  1995年   7篇
  1994年   15篇
  1993年   15篇
  1992年   11篇
  1991年   14篇
  1990年   9篇
  1989年   11篇
  1988年   18篇
  1987年   8篇
  1986年   17篇
  1985年   13篇
  1984年   6篇
  1983年   7篇
  1982年   9篇
  1981年   12篇
  1980年   8篇
  1979年   14篇
  1978年   11篇
  1977年   10篇
  1976年   5篇
  1975年   11篇
  1974年   9篇
  1973年   9篇
  1972年   9篇
  1971年   4篇
  1970年   4篇
  1969年   8篇
  1968年   7篇
  1967年   4篇
  1966年   6篇
排序方式: 共有609条查询结果,搜索用时 15 毫秒
41.
42.
Whether or not Colombia has improved is a controversial topic. If improvement has occurred, what, if any, lessons from the Colombian model can be learned? The first lesson is that Colombia's problems were caused more by a weak state than by drugs. The second lesson is that improving state capacity requires more than just increased security. The state must also provide the basic social services that citizens require to gain and maintain their support. Additionally, government institutions need to improve their professionalism, protect human rights, and root out impunity and corruption. The alternative is to suffer from new cycles of violence as old foes are vanquished, but new ones emerge.  相似文献   
43.
44.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
45.
The goal of this article is to challenge the assumption of rationality in the behavior of decision-making units involved in security, defense, intelligence and warfare and to consider the influence of “motivated bias” in such instances. A review of motivational literature within international politics and a discussion of literature applying “motivated biases” to warfare and strategic surprise will offer an alternative view of the primacy of rationality in such decisions.  相似文献   
46.
47.
The present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon.  相似文献   
48.
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.  相似文献   
49.
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.  相似文献   
50.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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