首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   399篇
  免费   16篇
  2021年   9篇
  2020年   4篇
  2019年   10篇
  2017年   9篇
  2016年   8篇
  2015年   11篇
  2014年   5篇
  2013年   83篇
  2011年   7篇
  2009年   5篇
  2008年   4篇
  2007年   8篇
  2005年   7篇
  2004年   6篇
  2003年   7篇
  2002年   4篇
  2001年   4篇
  2000年   3篇
  1999年   11篇
  1996年   5篇
  1995年   6篇
  1994年   8篇
  1993年   7篇
  1992年   8篇
  1991年   10篇
  1990年   5篇
  1989年   7篇
  1988年   9篇
  1987年   7篇
  1986年   9篇
  1985年   6篇
  1983年   3篇
  1982年   9篇
  1981年   4篇
  1980年   5篇
  1979年   6篇
  1978年   4篇
  1977年   6篇
  1976年   3篇
  1975年   6篇
  1974年   9篇
  1973年   6篇
  1972年   6篇
  1971年   11篇
  1970年   3篇
  1969年   7篇
  1968年   8篇
  1967年   4篇
  1966年   4篇
  1948年   4篇
排序方式: 共有415条查询结果,搜索用时 15 毫秒
191.
In a recent paper in this journal, Wijewerra and Webb study the connection between military spending and gross domestic product (GDP) in a group of five South Asian countries, finding a small but statistically significant positive relationship between military spending and GDP. This paper reviews their approach and proposes an alternative which tries to deal with the problems of omitted variables and variable construction. It finds, in contrast, that a higher share of military spending in GDP is associated with lower growth of GDP per capita.  相似文献   
192.
193.
194.
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
195.
There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if Xi = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015  相似文献   
196.
This article analyzes India's nuclear doctrine, finding it to be critically flawed and inimical to strategic stability in South Asia. In pursuing an ambitious triad of nuclear forces, India is straying from the sensible course it charted after going overtly nuclear in 1998. In doing so, it is exacerbating the triangular nuclear dilemma stemming from India's simultaneous rivalries with China and Pakistan. Strategic instability is compounded by India's pursuit of conventional “proactive strategy options,” which have the potential to lead to uncontrollable nuclear escalation on the subcontinent. New Delhi should reaffirm and redefine its doctrine of minimum credible nuclear deterrence, based on small nuclear forces with sufficient redundancy and diversity to deter a first strike by either China or Pakistan. It should also reinvigorate its nuclear diplomacy and assume a leadership role in the evolving global nuclear weapon regime.  相似文献   
197.
198.
199.
200.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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