全文获取类型
收费全文 | 440篇 |
免费 | 15篇 |
国内免费 | 1篇 |
出版年
2021年 | 10篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2014年 | 10篇 |
2013年 | 70篇 |
2012年 | 6篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1973年 | 8篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有456条查询结果,搜索用时 46 毫秒
101.
Exact first and second order moments of order statistics from the truncated exponential distribution
Exact expressions for the first and second order moments of order statistics from the truncated exponential distribution, when the proportion 1–P of truncation is known in advance, are presented in this paper. Tables of expected values and variances-covariances are given for P = 0.5 (0.1) 0.9 and n = 1 (1) 10. 相似文献
102.
Michael H. Rothkopf 《海军后勤学研究》1975,22(4):829-830
A recent article in this journal by Mehta, Chandrasekaran, and Emmons [1] described a dynamic programming algorithm for assigning jobs to two identical parallel processors in a way that minimizes the average delay of these jobs. Their problem has a constraint on the sequence of the jobs such that any group of jobs assigned to a processor must be processed in the order of the sequence. This note has two purposes. First, we wish to point out a relationship between this work and some prior work [2]. Second, we wish to point out that Mehta, Chandrasekaran, and Emmons formulation, slightly generalized, can be used to find the optimum assignment of jobs to two machines in a more general class of problems than they considered including a subclass in which the jobs are not constrained to be processed in a given sequence. 相似文献
103.
This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed. 相似文献
104.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
105.
Many optimization problems occur in both theory and practice when one has to optimize an objective function while an infinite number of constraints must be satisfied. The aim of this paper in to describe methods of handling such problems numerically in an effective manner. We also indicate a number of applications. 相似文献
106.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
107.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail. 相似文献
108.
109.
110.
Jerrold H. May 《海军后勤学研究》1982,29(3):429-442
Must Newton-type methods for linearly constrained optimization be either of the modified Newton or quasi-Newton variety? The contention of this paper is that explicity recomputing part of the projected Hessian may be superior to both approaches. A computational comparison with MINOS is presented. 相似文献