全文获取类型
收费全文 | 200篇 |
免费 | 6篇 |
出版年
2021年 | 8篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2014年 | 4篇 |
2013年 | 30篇 |
2012年 | 2篇 |
2010年 | 2篇 |
2009年 | 7篇 |
2007年 | 5篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1971年 | 3篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有206条查询结果,搜索用时 15 毫秒
161.
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n2m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems. 相似文献
162.
We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
163.
164.
P. K. Gautam 《Defense & Security Analysis》2009,25(4):413-423
165.
Sean K. Anderson 《Low Intensity Conflict & Law Enforcement》2002,11(2):254-270
Terrorist networks involve not only non-state actors but also an international environment in which state sponsors and 'gray areas' play significant roles. Non-state actors need the sanctuaries of state sponsors and of areas outside of effective state control to recruit, organize, and train their ranks, and to finance their activities. Through statistical analysis of statements of Iranian state intentions, and measures of direct US military interventions, this study examines how US military interventions into Iran's perceived sphere of interests deterred Iranian support for terrorist actions by its proxy groups against United States targets from 1980 to 1990. 相似文献
166.
Pavel K. Baev 《Contemporary Security Policy》2016,37(1):89-110
High-level declarations in Moscow and Beijing on the steady progress in upgrading their strategic partnership depart increasingly far from the reality of shrinking economic ties and diverging political perspectives. In late 2014, the dynamic development of this partnership appeared to have the potential of becoming a major shift in the fluid security balance in the Asia-Pacific region; in late 2015, however, the concerned neighbours have more reasons to worry about the deformations in the development of Russia–China relations. President Vladimir Putin and President Xi Jinping are eager to demonstrate perfect personal rapport but their mutual trust is open to doubt and their views on priorities of domestic and international order are in fact strikingly dissimilar. The deep contraction of trade and the lack of interest from Chinese investors propels the Russian leadership towards increasing the emphasis on the security dimension of the partnership, and this makes Russia one of the key sources of instability in the Asia-Pacific region and a challenge to the East Asian peace. It is also entirely possible that the Russian challenge to the stability of the world system would result in strengthening of the key institutions of its governance, thus leaving the revisionist Russia in isolation. 相似文献
167.
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 相似文献
168.
Raymond K. Cheung 《海军后勤学研究》1998,45(8):769-789
We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the objective of minimizing the expected cost from the current node to the destination node. This paper proposes an approach, which mimics the classical label-correcting approach, to compute the expected path cost. First, we develop a sequential implementation of this approach and establish some properties about the implementation. Next, we develop stochastic versions of some well-known label-correcting methods, including the first-in-first-out method, the two-queue method, the threshold algorithms, and the small-label-first principle. We perform numerical experiments to evaluate these methods and observe that fast methods for deterministic networks can become very slow for stochastic networks. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 769–789, 1998 相似文献
169.
Ilmari Käihkö 《Defence Studies》2018,18(2):147-166
At the core of waging war and strategy is the creation, control and use of force. This article investigates the volunteer battalions that mobilized in Ukraine during the spring of 2014. It contextualizes the volunteer phenomenon and focuses on the state strategies to establish control over these militias. As ambiguous entities arising from a situation characterized by rapid social change – revolution and war – the volunteer battalions threatened existing hierarchies and questioned state authority. The situation was exacerbated by the war, which deviated from the expectations of Ukrainian combatants and Western military observers alike. The state nevertheless enjoyed a modicum of success in reining in the militias through four strategies of undermining, co-option, incorporation and coercion. While predominantly integrated into a more rigid category of paramilitary forces, the volunteers continue to play a role in both the Ukrainian society and security sector to the unforeseeable future. 相似文献
170.
We consider stochastic scheduling models which have the natural character that jobs improve while being processed, but deteriorate (and may possibly leave the system altogether) while processing is diverted elsewhere. Such restless bandit problems are shown to be indexable in the sense of Whittle. A numerical study which elucidates the strong performance of the resulting index policy is complemented by a theoretical study which demonstrates the optimality of the index policy under given conditions and which develops performance guarantees for the index heuristic more generally. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 706–721, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10036 相似文献