全文获取类型
收费全文 | 399篇 |
免费 | 10篇 |
出版年
2020年 | 4篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 12篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 105篇 |
2011年 | 4篇 |
2010年 | 3篇 |
2009年 | 7篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 14篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1974年 | 5篇 |
1973年 | 2篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1970年 | 9篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 8篇 |
1966年 | 3篇 |
排序方式: 共有409条查询结果,搜索用时 15 毫秒
21.
22.
The existing literature concentrates on determining sharp upper bounds for EVPI in stochastic programming problems. This seems to be a problem without an application. Lower bounds, which we view as having an important application, are only the incidental subject of study and in the few instances that are available are obtained at an extremely high cost. In order to suggest a rethinking of the course of this research, we analyze the need for bounds on EVPI in the context of its significance in decision problems. 相似文献
23.
24.
Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017 相似文献
25.
Peter Olsthoorn 《Journal of Military Ethics》2017,16(1-2):78-93
In recent years, it has been argued more than once that situations determine our conduct to a much greater extent than our character does. This argument rests on the findings of social psychologists such as Stanley Milgram, who have popularized the idea that we can all be brought to harm innocent others. An increasing number of philosophers and ethicists make use of such findings, and some of them have argued that this so-called situationist challenge fatally undermines virtue ethics. As virtue ethics is currently the most popular underpinning for ethics education in the military, it is important to know to what extent the claim situationists make is correct. Fortunately, a closer look indicates that an interactionist perspective, with our character and the situation interplaying, is more accurate than the situationist perspective. 相似文献
26.
The paper explores terrorist choice by applying two well-known theoretical frameworks: stochastic dominance and prospect theory (PT). We analyse each pair of attack methods that can be formed from the RAND-MIPT database and the Global Terrorism Database. Instances of stochastic dominance are identified. PT orderings are computed. Attention is accorded to the identification of ‘trigger points’ and the circumstances that may lead to an increased likelihood that a terrorist will select an attack method associated with a higher expected number of fatalities, i.e. a potentially more damaging attack method. 相似文献
27.
28.
29.
30.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献