首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   512篇
  免费   55篇
  国内免费   1篇
  2021年   6篇
  2019年   14篇
  2018年   8篇
  2017年   15篇
  2016年   18篇
  2015年   20篇
  2014年   17篇
  2013年   128篇
  2012年   15篇
  2011年   11篇
  2010年   11篇
  2009年   13篇
  2008年   14篇
  2007年   14篇
  2006年   12篇
  2005年   13篇
  2004年   9篇
  2003年   14篇
  2002年   12篇
  2001年   8篇
  2000年   8篇
  1999年   8篇
  1997年   5篇
  1996年   7篇
  1994年   5篇
  1993年   10篇
  1992年   6篇
  1991年   8篇
  1989年   7篇
  1988年   5篇
  1987年   4篇
  1986年   6篇
  1985年   8篇
  1984年   5篇
  1983年   4篇
  1982年   5篇
  1981年   4篇
  1980年   8篇
  1979年   8篇
  1978年   8篇
  1976年   7篇
  1975年   10篇
  1974年   6篇
  1973年   8篇
  1972年   5篇
  1971年   4篇
  1970年   5篇
  1969年   4篇
  1968年   5篇
  1967年   3篇
排序方式: 共有568条查询结果,搜索用时 46 毫秒
501.
This essay re-examines coalition warfare during the Napoleonic era by looking at the three eastern European powers – Austria, Prussia and Russia – how they interacted over time with France as well as each other, and how they managed French preponderance on the Continent. Before 1812, coalition warfare was dominated by eighteenth-century military and diplomatic attitudes: overall foreign political goals were ill-defined and were characterised by deep mistrust. The result was that the eastern powers pursued their own interests with little regard to coalition cohesion. If the coalition held together in 1813 and 1814, on the other hand, it was largely because individual powers' self-interest coincided with the overall objectives of the coalition – an increased determination to defeat Napoleon – along with a never before seen numerical superiority in allied troops. In this, Austria and especially Chancellor Metternich's role in juggling conflicting interests between the allies so that they could present, for the first time, a united front against France was fundamental.  相似文献   
502.
503.
504.
505.
506.
We introduce an optimal stopping problem for selling an asset when the fixed but unknown distribution of successive offers is from one of n possible distributions. The initial probabilities as to which is the true distribution are given and updated in a Bayesian manner as the successive offers are observed. After receiving an offer, the seller has to decide whether to accept the offer or continue to observe the next offer. Each time an offer is observed a fixed cost is incurred. We consider both the cases where recalling a past offer is allowed and where it is not allowed. For each case, a dynamic programming model and some heuristic policies are presented. Using simulation, the performances of the heuristic methods are evaluated and upper bounds on the optimal expected return are obtained. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
507.
Accelerated life testing (ALT) is commonly used to obtain reliability information about a product in a timely manner. Several stress loading designs have been proposed and recent research interests have emerged concerning the development of equivalent ALT plans. Step‐stress ALT (SSALT) is one of the most commonly used stress loadings because it usually shortens the test duration and reduces the number of required test units. This article considers two fundamental questions when designing a SSALT and provides formal proofs in answer to each. Namely: (1) can a simple SSALT be designed so that it is equivalent to other stress loading designs? (2) when optimizing a multilevel SSALT, does it degenerate to a simple SSALT plan? The answers to both queries, under certain reasonable model assumptions, are shown to be a qualified YES. In addition, we provide an argument to support the rationale of a common practice in designing a SSALT, that is, setting the higher stress level as high as possible in a SSALT plan. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
508.
In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
509.
Although the Soviet missile defence effort was begun to protect the USSR from attack by nuclear missiles, Khrushchev was quick to see its political value, and used the prospect of an anti‐ballistic missile system to emphasize Soviet technological superiority. Within the Soviet armed forces there was widespread consensus about the importance of ABM's damage‐limiting role. The debates about strategy for future war in Soviet military publications demonstrate that support in the armed forces for an ABM capability transcended service loyalties and remained remarkably strong even after 1962, when technical problems and an effort to improve relations with the US following the Cuban Missile Crisis meant that the missile defence project no longer enjoyed the public backing of senior Party and military figures.  相似文献   
510.
This article discusses a two‐player noncooperative nonzero‐sum inspection game. There are multiple sites that are subject to potential inspection by the first player (an inspector). The second player (potentially a violator) has to choose a vector of violation probabilities over the sites, so that the sum of these probabilities do not exceed one. An efficient method is introduced to compute all Nash equilibria parametrically in the amount of resource that is available to the inspector. Sensitivity analysis reveals nonmonotonicity of the equilibrium utility of the inspector, considered as a function of the amount of resource that is available to it; a phenomenon which is a variant of the well‐known Braess paradox. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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