全文获取类型
收费全文 | 586篇 |
免费 | 16篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 5篇 |
2017年 | 18篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 16篇 |
2013年 | 117篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 5篇 |
2002年 | 11篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 15篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 17篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有602条查询结果,搜索用时 15 毫秒
391.
Theodor J. Stewart 《海军后勤学研究》1985,32(2):263-274
A search model is formulated in which positive information may be obtained, through the detection of trails, as to the target's earlier whereabouts. The corresponding Bayesian update formulas for target location probabilities are derived. The model does not appear to be amenable to rigorous optimization. A moving-horizon rule, and a heuristic simplification thereof, are, however, derived. In two numerical examples it is demonstrated that actively designing for detecting trail information, through use of these moving-horizon rules, has substantial potential advantage over using, for example, myopic rules even if the positive information is adaptively incorporated into location probabilities before applying the latter rules in each time period. 相似文献
392.
393.
394.
395.
In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(nm–2 log n) algorithm for the m-center problem where m ≥ 4. 相似文献
396.
Alan Chivers Andrew Lambert James J. Wirtz Paul Watts 《Defense & Security Analysis》1990,6(4):431-437
Encyclopaedia of Modern Air Force Squadrons. By Chris Ashworth. Patrick Stephens, London (1989), ISBN 1-8526-013-6, £19.95
The Future of Sea Power. By Eric Grove. Routledge, London (1990), ISBN 0-415-00482-9, £35.00
Soviet Strategic Interests in the North. By Kirsten Amundsen. Pinter, London (1990), ISBN 0-86187-018-2, £30.00
Soviet Seapower in Northern Waters. Edited by John Skogan and Arne Brundtland. Pinter, London (1990), ISBN 0-86187-038-7, £35.00
Glasnost, Perestroika, and U.S. Defense Spending. By William W. Kaufmann, Brookings Institution, Washington, DC (1990), ISBN 0-8157-4881-7, $8.95
The Educating of Armies. Edited by Michael D. Stephens. Macmillan, London (1989), ISBN 0-333-43447-1, £35.00 相似文献
The Future of Sea Power. By Eric Grove. Routledge, London (1990), ISBN 0-415-00482-9, £35.00
Soviet Strategic Interests in the North. By Kirsten Amundsen. Pinter, London (1990), ISBN 0-86187-018-2, £30.00
Soviet Seapower in Northern Waters. Edited by John Skogan and Arne Brundtland. Pinter, London (1990), ISBN 0-86187-038-7, £35.00
Glasnost, Perestroika, and U.S. Defense Spending. By William W. Kaufmann, Brookings Institution, Washington, DC (1990), ISBN 0-8157-4881-7, $8.95
The Educating of Armies. Edited by Michael D. Stephens. Macmillan, London (1989), ISBN 0-333-43447-1, £35.00 相似文献
397.
John J. Kanet 《海军后勤学研究》1981,28(4):643-651
This paper considers a single-machine scheduling problem in which penalities occur when a job is completed early or late. The objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions for jobs. A procedure is presented for finding an optimal schedule. 相似文献
398.
A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems. 相似文献
399.
The loading problem we consinder is to assign a set of discrete objects, each having a weight, to a set of boxes, each of which has a capacity limit, in such a way that every object is assigned to a box and the number of boxes used is minimized. A characterization of the assignments is offered and used to develop a set of rules for generating nonredundant assignments. The rules are incorporated into an implicit enumeration algorithm. The algorithm is tested against a very good heuristic. Computational experience shows that the algorithm is highly efficient, solving problems of up to 3600 0-1 variables in a CPU second. 相似文献
400.
C. J. Ancker 《海军后勤学研究》1976,23(4):703-711
In this analysis we extend the theory of stochastic duels to include the situation where one of the contestants fires a single infinitely long burst at a fixed rate of fire and secondly where he fires fixed-length, fixed-rate of fire bursts randomly spaced. In both cases the opponent fires single rounds randomly spaced. Special cases and parameter effects are considered. 相似文献