首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   403篇
  免费   8篇
  2021年   7篇
  2019年   11篇
  2018年   4篇
  2017年   5篇
  2016年   8篇
  2015年   4篇
  2014年   6篇
  2013年   65篇
  2012年   4篇
  2009年   4篇
  2007年   13篇
  2005年   2篇
  2004年   3篇
  2003年   7篇
  2002年   6篇
  2001年   2篇
  2000年   3篇
  1999年   3篇
  1998年   9篇
  1997年   8篇
  1996年   9篇
  1995年   3篇
  1994年   6篇
  1993年   11篇
  1992年   8篇
  1991年   9篇
  1990年   10篇
  1989年   18篇
  1988年   14篇
  1987年   7篇
  1986年   14篇
  1985年   9篇
  1984年   4篇
  1983年   3篇
  1982年   11篇
  1981年   6篇
  1980年   7篇
  1979年   9篇
  1978年   8篇
  1977年   5篇
  1976年   5篇
  1975年   4篇
  1974年   8篇
  1973年   6篇
  1972年   4篇
  1971年   7篇
  1970年   6篇
  1969年   5篇
  1967年   6篇
  1948年   4篇
排序方式: 共有411条查询结果,搜索用时 15 毫秒
351.
We investigate periodic replacement policies with minimal repair at failure, thereby, minimizing the average expected cost per unit time over an infinite time span. The standard cost structure is modified by the introduction of a term which takes adjustment costs into account.  相似文献   
352.
Detailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other ways This paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron- Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible cases.  相似文献   
353.
354.
This paper is concerned with assigning and sequencing a set of activities for some or all members of a crew of operators so that the completion time of all such operations is minimized. It is assumed that each of the operators in the crew possesses, initially, certain tasks that only he can perform. A branch-and-bound scheme is proposed to treat the problem, and suitable computational experience is provided.  相似文献   
355.
This paper investigates a new procedure for solving the general-variable pure integer linear programming problem. A simple transformation converts the problem to one of constructing nonnegative integer solutions to a system of linear diophantine equations. Rubin's sequential algorithm, an extension of the classic Euclidean algorithm, is used to find an integer solution to this system of equations. Two new theorems are proved on the properties of integer solutions to linear systems. This permits a modified Fourier-Motzkin elimination method to be used to construct a nonnegative integer solution. An experimental computer code was developed for the algorithm to solve some test problems selected from the literature. The computational results, though limited, are encouraging when compared with the Gomory all-integer algorithm.  相似文献   
356.
357.
This paper presents a simple algorithm for finding the number of restricted k-partitions of a natural number n. The unrestricted k-partitions of n are expressed as the sum of these restricted k-partitions, called inadmissible, and the admissible k-partitions. The simplicity of the algorithm is striking, though all the implications are unclear.  相似文献   
358.
Consider the problem of computing an offset circle probability under a normal distribution. One approach is to utilize an infinite series representation in which case it is important to have rapid convergence and a good upper bound on the error introduced by consideration of only a finite number of terms of the series. We relate three seemingly different series representations. In particular we show how two series representations for the bivariate case can be obtained by specializing more general results of Harold Ruben.  相似文献   
359.
This paper considers sequential test procedures to decision problems where there exists time delays in obtaining observations.  相似文献   
360.
This paper describes a technique for the calculation of the probability that a helicopter can lift a specified load, or number of loads with a specified frequency distribution, in a given geographical region. This probability is computed by determining the bivariate altitude-temperature probability distribution for the specified region. The payload capability at any given temperature and altitude is calculated from standard performance equations. By integrating this over the altitude-temperature distribution, it is possible to obtain the probability distribution of payload capability, from which the required probabilities of lifting specific loads can be determined.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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