首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   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 毫秒
71.
72.
…Rapid indigenisation is the cornerstone of our policy of self-reliance

India MoD Annual Report 1978–9
  相似文献   
73.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015  相似文献   
74.
This article proposes a strategic reason for a proprietary component supplier to license her technology to a competitor or a manufacturer: her anticipation of the manufacturer's strategic commitment to invest in research and development (R&D). We address this phenomenon with a game theoretic model. Our results show that the manufacturer's full commitment to invest in R&D enables the supplier to license, sell a larger quantity through the supply chain, and charge lower prices. These results are robust to the type of demand uncertainty faced by the manufacturer within the class of increasing generalized failure rate distributions. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 341–350, 2014  相似文献   
75.
76.
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.  相似文献   
77.
78.
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  相似文献   
79.
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.  相似文献   
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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