全文获取类型
收费全文 | 442篇 |
免费 | 9篇 |
出版年
2021年 | 11篇 |
2019年 | 11篇 |
2017年 | 11篇 |
2016年 | 8篇 |
2015年 | 11篇 |
2014年 | 9篇 |
2013年 | 94篇 |
2010年 | 3篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 3篇 |
1989年 | 10篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 5篇 |
1970年 | 5篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有451条查询结果,搜索用时 15 毫秒
201.
We consider the problem of service rate control of a single‐server queueing system with a finite‐state Markov‐modulated Poisson arrival process. We show that the optimal service rate is nondecreasing in the number of customers in the system; higher congestion levels warrant higher service rates. On the contrary, however, we show that the optimal service rate is not necessarily monotone in the current arrival rate. If the modulating process satisfies a stochastic monotonicity property, the monotonicity is recovered. We examine several heuristics and show where heuristics are reasonable substitutes for the optimal control. None of the heuristics perform well in all the regimes and the fluctuation rate of the modulating process plays an important role in deciding the right heuristic. Second, we discuss when the Markov‐modulated Poisson process with service rate control can act as a heuristic itself to approximate the control of a system with a periodic nonhomogeneous Poisson arrival process. Not only is the current model of interest in the control of Internet or mobile networks with bursty traffic, but it is also useful in providing a tractable alternative for the control of service centers with nonstationary arrival rates. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 661–677, 2013 相似文献
202.
A framework involving independent competing risks permits observing failures due to a specific cause and failures due to a competing cause, which constitute survival times from the cause of primary interest. Is observing more failures more informative than observing survivals? Intuitively, due to the definitiveness of failures, the answer seems to be the former. However, it has been shown before that this intuition holds when estimating the mean but not the failure rate of the exponential model with a gamma prior distribution for the failure rate. In this article, we address this question at a more general level. We show that for a certain class of distributions failures can be more informative than survivals for prediction of life length and vice versa for some others. We also show that for a large class of lifetime models, failure is less informative than survival for estimating the proportional hazards parameter with gamma, Jeffreys, and uniform priors. We further show that, for this class of lifetime models, on average, failure is more informative than survival for parameter estimation and for prediction. These results imply that the inferential purpose and properties of the lifetime distribution are germane for conducting life tests. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
203.
204.
We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n2) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n2) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013 相似文献
205.
206.
207.
208.
209.
A fundamental contradiction has been built into America's intervention in Afghanistan since the first days of the war in 2001. On the one hand, US policymakers have viewed the promotion of liberal democracy, economic development, and strong centralized state institutions as essential to achieve victory over the long term. On the other hand, however, the US has relied on local warlords to win its battles against the Taliban from the first days of the intervention. The Obama administration's tortured policy review reflects the intractable dilemmas involved in trying to build a modern democratic state while relying on local warlords as crucial allies in the war against the Taliban. 相似文献
210.
Jason S. Ridler 《Small Wars & Insurgencies》2013,24(2):292-312
Charles Ted Rutledge Bohannan (1914–1982) became an integral agent of US counterinsurgency operations during the early Cold War, contributing to both the success of the COIN effort to defeat the communist Huk insurgents in the Philippines and the stalled COIN efforts in Vietnam. In the early 1960s, he wrote a short and compact analysis of the US and Filipino experience of guerrilla warfare, from the Philippine–American war until the defeat of the Huk Rebellion. It was never published. Reprinted here, Bohannan's analysis of lessons learned makes a substantial contribution to the history of American ideas of unconventional warfare by an expert who contributed these lessons to the successful defeat of an insurgency in South East Asia. 相似文献