全文获取类型
收费全文 | 574篇 |
免费 | 14篇 |
出版年
2019年 | 12篇 |
2017年 | 17篇 |
2016年 | 11篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 113篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 11篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 13篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 14篇 |
1988年 | 14篇 |
1987年 | 15篇 |
1986年 | 16篇 |
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年 | 9篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有588条查询结果,搜索用时 62 毫秒
381.
A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue. 相似文献
382.
383.
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. 相似文献
384.
385.
386.
387.
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. 相似文献
388.
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 相似文献
389.
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. 相似文献
390.
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. 相似文献