首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   535篇
  免费   13篇
  2021年   10篇
  2019年   12篇
  2018年   10篇
  2017年   11篇
  2016年   9篇
  2015年   14篇
  2014年   13篇
  2013年   99篇
  2009年   4篇
  2008年   4篇
  2007年   4篇
  2006年   4篇
  2005年   5篇
  2003年   8篇
  2002年   7篇
  2001年   8篇
  2000年   7篇
  1999年   5篇
  1998年   9篇
  1997年   11篇
  1996年   5篇
  1995年   7篇
  1994年   9篇
  1993年   11篇
  1992年   9篇
  1991年   11篇
  1990年   6篇
  1989年   11篇
  1988年   21篇
  1987年   9篇
  1986年   20篇
  1985年   11篇
  1984年   8篇
  1983年   8篇
  1982年   4篇
  1981年   9篇
  1980年   7篇
  1979年   14篇
  1978年   8篇
  1977年   8篇
  1976年   5篇
  1975年   11篇
  1974年   13篇
  1973年   7篇
  1972年   11篇
  1971年   8篇
  1970年   7篇
  1969年   9篇
  1968年   6篇
  1966年   4篇
排序方式: 共有548条查询结果,搜索用时 15 毫秒
241.
The present paper presents an algorithm for the exact determination of survival distributions in crossing mine fields. The model under consideration considers clusters of mines, scattered at random in the field around specified aim points. The scatter distributions of the various clusters are assumed to be known The encounter process allows for a possible detection and destruction of the mines, for inactivation of the mines and for the possibility that an activated mine will not destroy the object. Recursive formulae for the determination of the survival probabilities of each object (tank) in a column of n crossing at the same path are given. The distribution of the number of survivors out of n objects in a column is also determined. Numerical examples are given.  相似文献   
242.
This paper develops an algorithm for a “shortest route” network problem in which it is desired to find the path which yields the shortest expected distance through the network. It is assumed that if a particular arc is chosen, then there is a finite probability that an adjacent arc will be traversed instead. Backward induction is used and appropriate recursion formulae are developed. A numerical example is provided.  相似文献   
243.
This paper considers the problem of modeling the reliability of a repairable system or device that is experiencing reliability improvement. Such a situation arises when system failure modes are gradually being corrected by a test-fix-test-fix procedure, which may include design changes. A dynamic reliability model for this process is discussed and statistical techniques are derived for estimating the model parameters and for testing the goodness-of-fit to observed data. The reliability model analyzed was first proposed as a graphical technique known as Duane plots, but can also be viewed as a nonhomogeneous Poisson process with a particular mean value function.  相似文献   
244.
A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context.  相似文献   
245.
The two inventory echelons under consideration are the depot, D, and k tender ships E1, …, Ek. The tender ships supply the demand for certain parts of operational boats (the customers). The statistical model assumes that the total monthly demands at the k tenders are stationary independent Poisson random variables, with unknown means λ1, …, λk. The stock levels on the tenders, at the heginning of each month, can be adjusted either by ordering more units from the depot, or by shipping bach to the depot an excess stock. There is no traffic of stock between tenders which is not via the depot. The lead time from the depot to the tenders is at most 1 month. The lead time for orders of the depot from the manufacturer is L months. The loss function due to erroneous decision js comprised of linear functions of the extra monthly stocks, and linear functions of shortages at the tenders and at the depot over the N months. A Bayes sequential decision process is set up for the optimal adjustment levels and orders of the two echelons. The Dynamic Programming recursive functions are given for a planning horizon of N months.  相似文献   
246.
A linear programming formulation is described that will permit the optimal assignment of transportation resources (vehicles) and movement requirements to a network consisting of a set of designated origins, ports of embarkation, enroute bases, ports of debarkation, and destinations to achieve a prescribed schedule of arrivals.  相似文献   
247.
The MAD model presents a mathematic treatment of the relationship between aircraft reliability and maintainability, system manning and inspection policies, scheduling and sortie length, and aircraft downtime. Log normal distributions are postulated for subsystem repair times and simultaneous repair of malfunctions is assumed. The aircraft downtime for maintenance is computed with the distribution of the largest of k log normal distributions. Waiting time for maintenance men is calculated either by using a multiple-channel queuing model or by generating the distribution of the number of maintenance men required and comparing this to the number of men available to determine the probability of waiting at each inspection.  相似文献   
248.
A fundamental unsolved problem in the programming area is one in which various activities have fixed charges (e.g., set-up time charges) if operating at a positive level. Properties of a general solution to this type problem are discussed in this paper. Under special circumstances it is shown that a fixed charge problem can be reduced to an ordinary linear programming problem.  相似文献   
249.
250.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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