全文获取类型
收费全文 | 640篇 |
免费 | 11篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 101篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 14篇 |
2004年 | 9篇 |
2003年 | 11篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 17篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 25篇 |
1988年 | 22篇 |
1987年 | 14篇 |
1986年 | 19篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 16篇 |
1979年 | 12篇 |
1978年 | 12篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 7篇 |
1972年 | 6篇 |
1971年 | 13篇 |
1970年 | 9篇 |
1969年 | 8篇 |
1968年 | 6篇 |
1967年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有651条查询结果,搜索用时 15 毫秒
501.
Consider a closed network of queues of the “product-form” type, where each station has s servers (s ≥ 1 is identical for all stations). We show that the throughput function of the network is Schur concave with respect to the loading of the stations and arrangement increasing with respect to the assignment of server groups. Consequently, different loading/assignment policies can be compared under majorization/arrangement orderings and their relative merits decided according to the yields of throughput. The results can be used to support planning decisions in computer and production systems which are modeled as closed networks of queues. 相似文献
502.
A military cannot hope to improve in wartime if it cannot learn. Ideally, in wartime, formal learning ceases and the application of knowledge begins. But this is optimistic. In 1942, USAAF Eighth Air Force assumed it had the means necessary for victory. In reality, its technique and technology were only potentially – rather than actually – effective. What remained was to create the practice of daylight bombing – to learn. This article (1) recovers a wartime learning process that created new knowledge, (2) tests existing tacit hypotheses in military adaptation research, and (3) offers additional theoretical foundation to explain how knowledge is created in wartime 相似文献
503.
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 相似文献
504.
Paul D. Miller 《战略研究杂志》2016,39(3):446-476
Decades of scholarship have warned against using historical analogies for policymaking. But the Taliban insurgency appears, on the surface, to confirm the usefulness of historical analogies to the British and Soviet wars in Afghanistan. I review the use of analogies for the war in Afghanistan and argue the analogies were historically unsound and strategically unhelpful. In fact, their effect on policy helped create the conditions for the very insurgency policymakers most hoped to avoid. The Taliban insurgency did not occur because of the presence of too many foreign troops and aid workers, but because there were too few. 相似文献
505.
506.
The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces. 相似文献
507.
Abdur R. Chowdhury 《Defence and Peace Economics》2016,27(5):583-608
We examine the role of war in retarding state fiscal capacity in developing countries, measured by tax revenue ratios to GDP. We build a simple theoretical model of a factionalized state, where patronage substitutes for common interest public goods, along with violent contestation over a rent or prize. Our dynamic panel empirical analysis applied to 79 developing countries, during 1980–2010, indicates that war, especially civil war, retards fiscal capacity, along with imperfect democracy, political repression, poor governance, and dependence on oil and macroeconomic mismanagement. High intensity conflict is particularly destructive of state capacity. In countries experiencing low intensity wars, other institutional factors may matter more than war. The diminution of fiscal capacity due to war appears less pronounced after the end of the cold war. 相似文献
508.
We solve the problem of optimal allocation of weapons to targets in the presence of layered regional defenses. The general solution technique is an integer program transformable to a minimum-cost network flow. This model assumes the defense has perfect weapons. Results of a small sample scenario are included. Additionally, a representative attrition algorithm is described and the two models combined to form a hybrid algorithm. The hybrid algorithm allows for less-than-perfect weapons while maintaining optimality. 相似文献
509.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献
510.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999 相似文献