首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   651篇
  免费   0篇
  651篇
  2021年   10篇
  2019年   13篇
  2018年   7篇
  2017年   8篇
  2016年   12篇
  2015年   6篇
  2014年   11篇
  2013年   112篇
  2012年   8篇
  2011年   5篇
  2010年   6篇
  2009年   7篇
  2007年   14篇
  2006年   7篇
  2004年   5篇
  2003年   9篇
  2002年   9篇
  2000年   5篇
  1998年   9篇
  1997年   11篇
  1996年   13篇
  1995年   5篇
  1994年   11篇
  1993年   17篇
  1992年   12篇
  1991年   15篇
  1990年   11篇
  1989年   21篇
  1988年   18篇
  1987年   10篇
  1986年   19篇
  1985年   14篇
  1984年   9篇
  1983年   6篇
  1982年   14篇
  1981年   10篇
  1980年   15篇
  1979年   14篇
  1978年   15篇
  1977年   6篇
  1976年   10篇
  1975年   14篇
  1974年   14篇
  1973年   11篇
  1972年   8篇
  1971年   10篇
  1970年   9篇
  1969年   9篇
  1968年   6篇
  1967年   7篇
排序方式: 共有651条查询结果,搜索用时 0 毫秒
241.
We consider the problem of searching for a target that moves in discrete time and space according to some Markovian process. At each time, a searcher attempts to detect the target. If the searcher's action at each time is such as to maximize his chances of immediate detection, we call his strategy “myopic.” We provide a computationally useful necessary condition for optimality, and use it to provide an example wherein the myopic strategy is not optimal.  相似文献   
242.
A single component system is assumed to progress through a finite number of increasingly bad levels of deterioration. The system with level i (0 ≤ i ≤ n) starts in state 0 when new, and is definitely replaced upon reaching the worthless state n. It is assumed that the transition times are directly monitored and the admissible class of strategies allows substitution of a new component only at such transition times. The durations in various deterioration levels are dependent random variables with exponential marginal distributions and a particularly convenient joint distribution. Strategies are chosen to maximize the average rewards per unit time. For some reward functions (with the reward rate depending on the state and the duration in this state) the knowledge of previous state duration provides useful information about the rate of deterioration.  相似文献   
243.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models.  相似文献   
244.
In military situations of sharply increasing combat activity the Marine Corps is faced with training problems in its expanding aviator corps. Additional training aircraft are required, and procurement decisions must be made. In view of the significant costs involved in procurement and operation of new high performance aircraft, it is very desirable to buy and operate an efficient mix of aircraft necessary for training the pilots to make the Marine Aircraft Wings essentially 100-percent tactically qualified. The mathematical model presented here enables computation of a least-cost mix of training aircraft which satisfies certain specified training requirements. The basic element allowing tradeoffs is the commonality of training available in the F4, RF4, A6, and EA6 types of aircraft. Both airframe oriented and mission oriented training are necessary, but the airframe oriented training can be conducted in either of the aircraft possessing the commonality. Training requirements over a five year period are considered, and the mix of training aircraft has the minimum five year procurement and operating cost.  相似文献   
245.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =

  相似文献   

246.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed.  相似文献   
247.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound.  相似文献   
248.
This paper discusses the operations analysis in the underwater search for the remains of the submarine Scorpion The a priori target location probability distribution for the search was obtained by monte-carlo procedures based upon nine different scenarios concerning the Scorpion loss and associated credibility weights. These scenarios and weights were postulated by others. Scorpion was found within 260 yards of the search grid cell having the largest a priori probability Frequent computations of local effectiveness probabilities (LEPs) were carried out on scene during the search and were used to determine an updated (a posteriori) target location distribution. This distribution formed the basis for recommendation of the current high probability areas for search The sum of LEPs weighted by the a priori target location probabilities is called search effectiveness probability (SEP) and was used as the overall measure of effectiveness for the operation. SEP and LEPs were used previously in the Mediterranean H-bomb search On-scene and stateside operations analysis are discussed and the progress of the search is indicated by values of SEP for various periods during the operation.  相似文献   
249.
A mathematical model is developed that enables organization and manpower planners to quantify the inefficiencies involved in rapid buildups of organizations, such as is frequently found in the aerospace industry shortly after the award of a major contract. Consideration is given to the time required to train, indoctrinate, and familiarize new workers with their jobs and the general program aspects. Once trained, workers are assumed to be productive. If the ratio of untrained to trained workers exceeds a critical value, called the buildup threshold, then the performance of the trained workers is degraded to the extent that they are no longer 100 percent efficient until this ratio returns to a value less than the threshold. The model is sufficiently general to consider an arbitrary manpower plan with more than one peak or valley. The model outputs are functions of real time and consist of the fraction of the total labor force which is productive, the fraction of the total labor units expended for nonproductive effort, the cumulative labor costs for productive effort, and the cumulative labor cost for all effort.  相似文献   
250.
Several approximate procedures are available in the literature for obtaining confidence intervals for the parameter A of an exponential distribution based on time truncated samples. This paper contains the results of an empirical study comparing three of these procedures.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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