首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   499篇
  免费   10篇
  509篇
  2021年   8篇
  2019年   12篇
  2018年   13篇
  2017年   7篇
  2016年   11篇
  2015年   5篇
  2014年   9篇
  2013年   100篇
  2009年   5篇
  2007年   14篇
  2006年   4篇
  2005年   7篇
  2004年   6篇
  2003年   10篇
  2002年   7篇
  2001年   3篇
  2000年   3篇
  1999年   3篇
  1998年   9篇
  1997年   9篇
  1996年   9篇
  1995年   6篇
  1994年   8篇
  1993年   12篇
  1992年   9篇
  1991年   10篇
  1990年   10篇
  1989年   20篇
  1988年   15篇
  1987年   9篇
  1986年   14篇
  1985年   9篇
  1984年   6篇
  1983年   3篇
  1982年   11篇
  1981年   6篇
  1980年   8篇
  1979年   9篇
  1978年   8篇
  1977年   5篇
  1976年   6篇
  1975年   4篇
  1974年   10篇
  1973年   8篇
  1972年   4篇
  1971年   7篇
  1970年   7篇
  1969年   6篇
  1967年   6篇
  1948年   4篇
排序方式: 共有509条查询结果,搜索用时 0 毫秒
91.
92.
This paper extends the joint product model of military alliances to apply to the new strategic doctrine adopted by NATO in the 1990s. In particular, a choice must be made between protecting one's own territory and pooling forces for an alliancewide rapid reaction force. This new model accounts for a host of externalities and their implications for burden sharing, full financing, and allocative efficiency. The Pigouvian taxes that adjust for force thinning and attack deflection are shown to finance optimal border‐protecting forces under a variety of circumstances. Second‐best considerations arise owing to the pure publicness of rapid reaction forces. The ideal toll arrangement does not currently characterize NATO financing, nor is it likely to do so.  相似文献   
93.
94.
In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.  相似文献   
95.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
96.
97.
This paper explores the notion that US efforts to evade the political costs of war paradoxically contribute to the subsequent exacerbation of costs over time. Leaders seek to purchase political capital in the short term by limiting the costs and requirements of military operations, but in doing so cause strategic and political liabilities to mount in the long run. While identification of such behaviour is not new, insufficient attention has been devoted to explaining its causes, dynamics, and manifestations in relation to key decisions on and in war. Evidence derived from studies of recent American discretionary campaigns is analysed to advance an argument with respect to this pattern of self-defeating strategic behaviour.  相似文献   
98.
Hakimi has considered the problem of finding an optimal location for a single service center, such as a hospital or a police station. He used a graph theoretic model to represent the region being serviced. The communities are represented by the nodes while the road network is represented by the ares of the graph. In his work, the objective is one of minimizing the maximum of the shortest distances between the vertices and the service center. In the present work, the region being serviced is represented by a convex polygon and communities are spread over the entire region. The objective is to minimize the maximum of Euclidian distances between the service center and any point in the polygon. Two methods of solution presented are (i) a geometric method, and (ii) a quadratic programming formulation. Of these, the geometric method is simpler and more efficient. It is seen that for a class of problems, the geometric method is well suited and very efficient while the graph theoretic method, in general, will give only approximate solutions in spite of the increased efforts involved. But, for a different class of problems, the graph theoretic approach will be more appropriate while the geometric method will provide only approximate solutions though with ease. Finally, some feasible applications of importance are outlined and a few meaningful extensions are indicated.  相似文献   
99.
Scholarly research and publication in many countries has made the Korean War not only remembered, but also better understood. Material from Russia and China have been especially helpful in adding nuance and detail to now‐dated writing about the war's causes. Much more work needs to be done on Korean politics and the 1952–53 period, but in all the scholarship simply confirms the shared responsibility of all the belligerents ‐ including the Koreans ‐ in starting and continuing the war.  相似文献   
100.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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