全文获取类型
收费全文 | 119篇 |
免费 | 2篇 |
出版年
2020年 | 1篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 5篇 |
2013年 | 48篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有121条查询结果,搜索用时 15 毫秒
91.
This article considers a special class of cost allocation problems, where the communication possibilities among the agents are restricted. Integral formulas are derived for two allocation rules: The Myerson value and the position value. © 1993 John Wiley & Sons, Inc. 相似文献
92.
A model which allows the prediction of long-term average report rates against an array of radio emitters by a scanning sensor is presented. The model is based on Markov renewal theory. 相似文献
93.
Strategic studies deals intimately with the topic of power. Most scholars in the discipline work with a concept of power as an adversarial zero-sum competition. This is natural and necessary. However, other conceptions of power developed within political science and sociology could enrich strategic studies. Approaching two typical, traditional tasks of strategy – alliance building and war-fighting – this article demonstrates the heuristic mileage of theories of collective power. In particular, we can shed new light on the post-Cold War transformation of NATO as well as state-building as a strategy in counter-insurgencies with new ideas of power. Broadening the palette of theories of power is thus valuable if strategic studies is to prosper as an independent field of study. 相似文献
94.
95.
96.
97.
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 相似文献
98.
This article reassesses the foreign policy legacy of George W. Bush in light of the emerging historical record of his administration. We conclude that, whereas Bush’s foreign policy was in widespread disrepute when he left office in 2009, that reputation is likely to improve – perhaps significantly – in the coming years. We identify six particular arguments that lend credence to an emerging ‘Bush revisionism.’ To be clear, we do not necessarily argue that the balance sheet on Bush’s foreign policy was positive, but the arguments presented here are likely to generate a more sympathetic and favorable historical assessment of Bush’s presidency over time. 相似文献
99.
Peter C. Fishburn 《海军后勤学研究》1988,35(6):567-574
It is shown that when X is an arbitrary finite subset of an n-factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification-extension procedure. 相似文献
100.
Peter De Waal 《海军后勤学研究》1993,40(5):719-731
In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or rejected and for this decision the state of the queue at the moment of arrival is available as information. To guarantee a high level of service, we formulate a constrained optimization problem. Two types of access control, viz., partitioning policies and sharing policies, are considered. The optimization problem is solved for partitioning policies and the performance of both types of policies is compared. © 1993 John Wiley & Sons, Inc. 相似文献