首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   568篇
  免费   0篇
  568篇
  2021年   13篇
  2019年   11篇
  2018年   8篇
  2017年   6篇
  2016年   10篇
  2014年   10篇
  2013年   84篇
  2012年   5篇
  2009年   11篇
  2007年   16篇
  2005年   4篇
  2004年   7篇
  2003年   10篇
  2002年   13篇
  2001年   7篇
  2000年   7篇
  1999年   5篇
  1998年   10篇
  1997年   11篇
  1996年   10篇
  1995年   9篇
  1994年   8篇
  1993年   13篇
  1992年   10篇
  1991年   14篇
  1990年   14篇
  1989年   21篇
  1988年   17篇
  1987年   14篇
  1986年   17篇
  1985年   7篇
  1984年   8篇
  1983年   6篇
  1982年   11篇
  1981年   10篇
  1980年   10篇
  1979年   11篇
  1978年   11篇
  1977年   10篇
  1976年   7篇
  1975年   7篇
  1974年   10篇
  1973年   9篇
  1972年   4篇
  1971年   8篇
  1970年   8篇
  1969年   8篇
  1968年   3篇
  1967年   6篇
  1948年   4篇
排序方式: 共有568条查询结果,搜索用时 0 毫秒
441.
442.
443.
It is shown that two recent results of Baxter and Harche [1] on monotone and balanced optimal assemblies hold only under conditions that are more restrictive than those originally proposed by the authors. We describe such additional conditions, illustrate why they are needed, and establish their sufficiency. We also consider a recent result by Malon [11] and demonstrate that, while the result itself is correct, its two proofs were incomplete. A complete proof of an extension of the result is then suggested. © 1995 John Wiley & Sons, Inc.  相似文献   
444.
Facing nearly half a billion dollars in spending cuts over the next five years, US defense planners and strategists must simultaneously rebuild a war-weary Army weakened from over a decade of war, build new sea and air capabilities for the Pacific theater, and reduce manpower, procurement, and contractor budgets while promoting innovation. The US defense department is embarking on what may be the most sweeping period of defense transformation in recent memory. This article reviews the history of American defense transformation, focusing on an important but largely overlooked period of military innovation that began in the shadow of Vietnam and ended with troops fighting through blinding sandstorms at night on the road to Baghdad. The multifaceted transformation strategy conceived in the 1970s paved the way for a military revolution in the 1990s and enabled unprecedented battlefield adaptation in the 2000s. After reviewing the revolutionary changes that led to American dominance in conventional warfare in the 1990s, the article examines US transformation policies in the 2000s to inform defense strategy and planning efforts in the 2010s.  相似文献   
445.
446.
The G/G/R machine repair problem with M operating machines, S warm standby spares, and R repairmen is studied as a diffusion process. The steady-state equations are formulated as diffusion equations subject to two reflecting barriers. The approximate diffusion parameters of the diffusion equations are obtained (1) under the assumption that the input characteristics of the problem are defined only by their first two moments rather than their probability distribution function, (2) under the assumption of heavy traffic approximation, that is, when queues of failed machines in the repair stage are almost always nonempty, and (3) using well-known asymptotic results from renewal theory. Expressions for the probability density functions of the number of failed machines in the system are obtained. A study of the derived approximate results, compared to some of the exact results, suggests that the diffusion approach provides a useful method for solving complex machine-repair problems.  相似文献   
447.
In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001  相似文献   
448.
449.
ABSTRACT

No issue deserves more scrutiny than the mechanisms whereby popular unrest unleashes civil wars. We argue that one institution – two-tiered security systems – is particularly pernicious in terms of the accompanying civil war risk. These systems’ defining characteristic is the juxtaposition of small communally stacked units that protect regimes from internal adversaries with larger regular armed forces that deter external opponents. These systems aggravate civil war risks because stacked security units lack the size to repress widespread dissent, but inhibit rapid regime change through coup d’état. Regular militaries, meanwhile, fracture when ordered to employ force against populations from which they were recruited.  相似文献   
450.
    
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^2kappa)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  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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