首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   521篇
  免费   4篇
  525篇
  2021年   5篇
  2020年   5篇
  2019年   12篇
  2018年   7篇
  2017年   14篇
  2016年   11篇
  2015年   7篇
  2014年   10篇
  2013年   123篇
  2012年   5篇
  2011年   6篇
  2010年   7篇
  2009年   6篇
  2008年   5篇
  2007年   6篇
  2006年   8篇
  2005年   6篇
  2003年   5篇
  2002年   5篇
  2001年   5篇
  2000年   5篇
  1998年   5篇
  1997年   7篇
  1996年   9篇
  1995年   8篇
  1994年   9篇
  1993年   11篇
  1992年   12篇
  1991年   15篇
  1989年   10篇
  1988年   7篇
  1987年   10篇
  1986年   10篇
  1985年   14篇
  1984年   7篇
  1982年   5篇
  1981年   5篇
  1980年   11篇
  1979年   7篇
  1978年   9篇
  1976年   8篇
  1975年   10篇
  1974年   10篇
  1973年   10篇
  1972年   5篇
  1971年   5篇
  1970年   8篇
  1969年   5篇
  1968年   7篇
  1967年   5篇
排序方式: 共有525条查询结果,搜索用时 0 毫秒
281.
    
  相似文献   
282.
    
In this article, we examine a model of terrorism that focuses on the tradeoffs facing a terrorist organization that has two qualitatively different attack modes at its disposal. The terrorist organization's objective is to successfully attack at least one target. Success for the target government is defined as defending all targets from any and all attacks. In this context, we examine how terrorist entities strategically utilize an efficient but discrete attack technology — e.g., suicide attacks — when a more conventional mode of attack is available, and the optimal anti‐terrorism measures.© 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
283.
    
We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014  相似文献   
284.
    
We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance.  相似文献   
285.
286.
In this article we define a class of distributions called bilateral phase type (BPH), and study its closure and computational properties. The class of BPH distributions is closed under convolution, negative convolution, and mixtures. The one-sided version of BPH, called generalized phase type (GPH), is also defined. The class of GPH distributions is strictly larger than the class of phase-type distributions introduced by Neuts, and is closed under convolution, negative convolution with nonnegativity condition, mixtures, and formation of coherent systems. We give computational schemes to compute the resulting distributions from the above operations and extend them to analyze queueing processes. In particular, we present efficient algorithms to compute the steady-state and transient waiting times in GPH/GPH/1 queues and a simple algorithm to compute the steady-state waiting time in M/GPH/1 queues.  相似文献   
287.
288.
By way of an evolutionary game model we show that mediation in international conflicts might be harmful to the conflicting parties. In fact, under anarchy both parties can be better off than under an international regime if mediation reduces the parties’ reactive capacities (i.e. their abilites to respond to an aggression). This result is applied to issues currently discussed in the literature on international relations such as the role of the United Nations as a mediator of international conflicts.  相似文献   
289.
290.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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