首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   563篇
  免费   14篇
  577篇
  2019年   12篇
  2017年   17篇
  2016年   10篇
  2015年   14篇
  2014年   15篇
  2013年   109篇
  2012年   5篇
  2011年   5篇
  2010年   8篇
  2009年   11篇
  2007年   6篇
  2006年   8篇
  2005年   9篇
  2004年   11篇
  2003年   5篇
  2002年   10篇
  2001年   4篇
  2000年   7篇
  1999年   6篇
  1998年   12篇
  1997年   6篇
  1996年   8篇
  1995年   4篇
  1994年   15篇
  1993年   14篇
  1992年   8篇
  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篇
排序方式: 共有577条查询结果,搜索用时 0 毫秒
21.
22.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach.  相似文献   
23.
The general problem we are concerned with here is the estimation of Pθ(C) where C is some fixed event and Pθ is unknown in some class. The various available estimation procedures seem to involve the choice of some random probability measure. In particular we consider this problem when C is a disk in R2 centered at o and Pθ is restricted to be bivariate normal. Details concerning the implementation of the estimation procedures and a Monte Carlo study are discussed for this case. This particular problem arises when we are concerned with assessing the accuracy of a targeting procedure.  相似文献   
24.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc.  相似文献   
25.
26.
Characteristics of supply performance at the top echelon of an optimally managed multiechelon supply system are investigated; insights are developed which are useful in devising coordinated single-echelon policies which can approximate the benefits derived from multiechelon management.  相似文献   
27.
Degeneracy in linear programming models has been analyzed for its impacts on algorithmic properties. A complementary analysis here is on what the solutions mean. The framework presented is couched in marginal sensitivity analysis, introducing concepts of “compatible bases” and “transition graphs”.  相似文献   
28.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.  相似文献   
29.
Book reviews     
Red Banner: the Soviet Military System in Peace and War. By Christopher Donnelly. Jane's Information Group, Coulsdon, UK (1988), 288 pp., £35.00

Images of T. E. Lawrence. By S. E. Tabachnick and C. Matheson. Jonathan Cape, London (1988); The Letters of T. E. Lawrence. Edited by Malcolm Brown. Dent, London (1988); T. E. Lawrence. By J. Wilson. National Portrait Gallery Publications, London (1988); Lawrence and the Arab Revolts. By D. Nicolle. Osprey, London (1989)

Liddell Hart and the Weight of History. By John Mearsheimer. Brassey's, London (1989), £15.95

Science and Mythology in the Making of Defence Policy. Edited by Margaret Blunden and Owen Greene. Brassey's, London (1989), £27.50/$44.00

Warfare in the Twentieth Century. Edited by Colin McInnes and G. D. Sheffield. Unwin Hyman, London (1988), 239 pp., £25.00  相似文献   
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号