全文获取类型
收费全文 | 759篇 |
免费 | 0篇 |
专业分类
759篇 |
出版年
2019年 | 16篇 |
2018年 | 9篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 20篇 |
2013年 | 173篇 |
2012年 | 7篇 |
2011年 | 10篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 12篇 |
2005年 | 15篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 13篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 13篇 |
1997年 | 8篇 |
1996年 | 11篇 |
1995年 | 7篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 13篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 16篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 10篇 |
1969年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有759条查询结果,搜索用时 0 毫秒
191.
192.
Jonathan J. Schroden 《战略研究杂志》2013,36(5):715-744
Quantitative measures to gauge progress in a counterinsurgency in use today include the number of enemy, friendly, and civilian casualties, and the level of violence. While common, each of these has drawbacks. With this and the sparseness of the literature on this topic in mind, we argue for a series of improved measures. These include the ratio of who is initiating incidents, an historical analysis of incidents and related variables, and an analysis of insurgent target sets. These measures are presented using data for Al Anbar province, Iraq, along with a discussion of their advantages over more common metrics. 相似文献
193.
194.
Brenda J. Lutz 《Small Wars & Insurgencies》2014,25(5-6):1039-1054
John Brown is usually not considered to have been a terrorist, and even recent analyses of his activities consider him to be a guerrilla fighter or insurgent in his activities in Kansas. Brown, however, meets the criteria of a terrorist more than a guerrilla fighter when his activities in the Kansas Territory are considered. His raid on Harpers Ferry, however, is more in line with guerrilla operations or insurgent activities. 相似文献
195.
196.
Gary J. Koehler 《海军后勤学研究》1981,28(1):83-92
In discounted Markov decision processes bounds on the optimal value function can be computed and used to eliminate suboptimal actions. In this paper we extend these procedures to the generalized Markov decision process. In so doing we forfeit the contraction property and must base our analysis on other procedures. Duality theory and the Perron-Frobenius theorem are the main tools. 相似文献
197.
M. J. M. Jansen 《海军后勤学研究》1981,28(1):147-152
In this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived. 相似文献
198.
This paper is concerned with the statistical test plans contained in Military Standard 781C, “Reliability Design Qualification and Production Acceptance Tests: Exponential Distribution” and the selection and use of these plans. Modifications to the fixed-length test plans of MIL-STD-781C are presented which allow early-accept decisions to be made without sacrificing statistical validity. The proposed plans differ from the probability ratio sequential tests in the Standard in that rejection is permitted only after a fixed number of failures have been observed. 相似文献
199.
T. J. Stewart 《海军后勤学研究》1981,28(3):393-406
A form of sequential decision problem is introduced in which options are presented in sequence. with no recall of rejected options (as in the secretary problem), but in which the value of each option may only he inferred from experiments. Decisions have thus to be made concerning both the acceptance and rejection of each option and the degree of experimentation. General properties of the optimal policy are derived, and an algorithm is obtained for the solution in a special case. This special case suggests a heuristic rule for more general situations. the performance of which rule has been investigated by a Monte Carlo study. 相似文献
200.
Francis J. Vasko 《海军后勤学研究》1984,31(1):163-171
A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems. 相似文献