首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   489篇
  免费   0篇
  489篇
  2021年   11篇
  2019年   20篇
  2018年   10篇
  2017年   10篇
  2016年   11篇
  2015年   11篇
  2014年   9篇
  2013年   93篇
  2011年   4篇
  2009年   5篇
  2008年   5篇
  2007年   5篇
  2006年   5篇
  2005年   9篇
  2004年   8篇
  2003年   6篇
  2002年   6篇
  2001年   4篇
  2000年   7篇
  1999年   4篇
  1998年   8篇
  1997年   15篇
  1996年   7篇
  1994年   10篇
  1992年   4篇
  1991年   13篇
  1990年   4篇
  1989年   7篇
  1988年   7篇
  1987年   14篇
  1986年   8篇
  1985年   6篇
  1984年   5篇
  1983年   8篇
  1982年   8篇
  1981年   5篇
  1980年   7篇
  1979年   11篇
  1978年   7篇
  1977年   8篇
  1976年   7篇
  1975年   7篇
  1974年   7篇
  1973年   12篇
  1972年   7篇
  1971年   6篇
  1970年   7篇
  1969年   6篇
  1968年   5篇
  1967年   5篇
排序方式: 共有489条查询结果,搜索用时 0 毫秒
351.
An area to be defended consists of separated point targets. These targets are subject to an attack in which the offensive weapons are assumed to arrive simultaneously. The defense has area defenders, each of which is capable of intercepting any attacker. The defense has no impact-point prediction; that is, it has no knowledge of any attacker's destination prior to allocation of area interceptors. For a given attack, the defense wishes to allocate its interceptors to maximize the total expected survival value of the targets. For a given attack size, the offense seeks a strategy to minimize total expected surviving value against best defense. We determine an optimal defensive strategy directly and develop an algorithm to determine an optimal attack and the optimal value of the min-max problem. A dynamic programming technique is used to obtain integer solutions, and illustrative computational results are provided.  相似文献   
352.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F.  相似文献   
353.
The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.  相似文献   
354.
Suppose that we have enough computer time to make n observations of a stochastic process by means of simulation and would like to construct a confidence interval for the steady-state mean. We can make k independent runs of m observations each (n=k.m) or, alternatively, one run of n observations which we then divide into k batches of length m. These methods are known as replication and batch means, respectively. In this paper, using the probability of coverage and the half length of a confidence interval as criteria for comparison, we empirically show that batch means is superior to replication, but that neither method works well if n is too small. We also show that if m is chosen too small for replication, then the coverage may decrease dramatically as the total sample size n is increased.  相似文献   
355.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed.  相似文献   
356.
357.
358.
Book reviews     
Soviet Nuclear Strategy from Stalin to Gorbachev: a Revolution in Soviet Military and Political Thinking. By Honore M. Catudal. Mansell, London (1988), ISBN 0–7201–2000–4, £25.00

The Military: More Than Just a Job? Edited by Charles C. Moskos and Frank R. Wood. Pergamon‐Brassey's, London (1988), ISBN 0–08–034321‐X, £17.00 ($30.00)

Douglas Haig, 1861–1928. By Gerard J. de Groot. Unwin Hyman, London (1988), ISBN 004 4401922, £20.00

Defence Policy Making. A Comparative Analysis. Edited by G. M. Dillon. Leicester University Press, Leicester (1988), ISBN 0–715–1268–5, £10.95

The Future of U.K. Air Power. Edited by P. Sabin. Brassey's, London (1988), ISBN 0–08–035825‐X (hardcover), 0–08–036256–7 (flexicover), hardcover £18.95 ($34.00), flexicover £9.95 ($17.95)  相似文献   

359.
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.  相似文献   
360.
A model of an M/M/1, bulk queue with service rates dependent on the batch size is developed. The operational policy is to commence service when at least L customers are available with a maximum batch size of K. Arriving customers are not allowed to join in-process service. The solution procedure utilizes the matrix geometric methodology and reduces to obtaining the inverse of a square matrix of dimension K + 1 - L. For the case where the service rates are not batch size dependent, the limiting probabilities can be written in closed form. A numerical example illustrates the variability of the system cost as a function of the minimum batch service size L.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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