首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   488篇
  免费   17篇
  505篇
  2020年   5篇
  2019年   11篇
  2018年   5篇
  2017年   14篇
  2016年   8篇
  2015年   9篇
  2014年   11篇
  2013年   109篇
  2010年   4篇
  2009年   4篇
  2007年   7篇
  2005年   4篇
  2004年   7篇
  2003年   4篇
  2002年   7篇
  2001年   8篇
  2000年   6篇
  1999年   7篇
  1998年   11篇
  1997年   10篇
  1996年   7篇
  1995年   13篇
  1994年   13篇
  1993年   12篇
  1992年   13篇
  1991年   11篇
  1990年   7篇
  1989年   6篇
  1988年   10篇
  1987年   10篇
  1986年   4篇
  1985年   9篇
  1984年   9篇
  1983年   6篇
  1982年   6篇
  1981年   9篇
  1980年   6篇
  1979年   11篇
  1978年   7篇
  1977年   6篇
  1976年   7篇
  1975年   8篇
  1974年   7篇
  1973年   6篇
  1972年   8篇
  1971年   7篇
  1970年   4篇
  1969年   4篇
  1968年   6篇
  1967年   6篇
排序方式: 共有505条查询结果,搜索用时 15 毫秒
221.
Planning for a cardiovascular disease reduction program, soon to be initiated by the United States Air Force, has required an evaluation of its expected cost effectiveness. During the course of this evaluation, it was necessary to consider manpower flows and their expected changes in response to the disease reduction program. This paper describes several manpower models that were applied: a simple expected value equilibrium model; a cross-sectional model that considered the length of service of personnel; and a staffing model used to optimize the allocation of paramedics to the many Air Force bases of various sizes. The relevance of these models to the cost effectiveness evaluation is shown but the detailed cost effectiveness results are not presented.  相似文献   
222.
This paper considers the search for an evader concealed in one of two regions, each of which is characterized by its detection probability. The single-sided problem, in which the searcher is told the probability of the evader being located in a particular region, has been examined previously. We shall be concerned with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move: his optimal strategy consists of that probability distribution which maximizes the expected time to detection, while the searcher's optimal strategy is the sequence of searches which limits the evader to this expected time. It transpires for this problem that optimal strategies for both searcher and evader may generally be obtained to a surprisingly good degree of approximation by using the optimal strategies for the closely related (but far more easily solved) problem in which the evader is completely free to move between searches.  相似文献   
223.
A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used.  相似文献   
224.
225.
CYLINDRICITYERRORCOMPENSATIONINDIAMONDTURNINGVIAP-INTEGRATORREPETITIVECONTROLLiShengyi(DepartmentofMechantronicsandInstrument...  相似文献   
226.
以双轴T型结构的超精密金刚石车床的伺服进给系统为研究对象,采用自构造神经网络技术,建立了系统的非线性动态数学模型,为系统非线性控制与补偿提供参考模型  相似文献   
227.
This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration type mutation. Convergence of the algorithm is proved. We present computational results on data sets from the auto industry. To demonstrate robustness of the approach, problems from the literature of different structure are solved by essentially the same algorithm. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 199–211, 1999  相似文献   
228.
This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009  相似文献   
229.
Banks have found it advantageous to connect their Automated Teller Machines (ATMs) in networks so that customers of one bank may use the ATMs of any bank in the network. When this occurs, an interchange fee is paid by the customer's bank to the one that owns the ATM. These have been set by historic interbank negotiation. The paper investigates how a model based on n-player game theory concepts of Shapley value and nucleolus could be used as an alternative way of setting such fees. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 407–417, 1998  相似文献   
230.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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