首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   370篇
  免费   9篇
  379篇
  2021年   10篇
  2019年   7篇
  2017年   8篇
  2016年   6篇
  2015年   11篇
  2014年   8篇
  2013年   67篇
  2010年   2篇
  2008年   4篇
  2007年   4篇
  2006年   4篇
  2005年   4篇
  2003年   2篇
  2002年   5篇
  2001年   6篇
  2000年   4篇
  1999年   4篇
  1998年   8篇
  1997年   8篇
  1996年   5篇
  1995年   6篇
  1994年   8篇
  1993年   7篇
  1992年   7篇
  1991年   8篇
  1990年   2篇
  1989年   7篇
  1988年   14篇
  1987年   6篇
  1986年   15篇
  1985年   9篇
  1984年   6篇
  1983年   5篇
  1982年   4篇
  1981年   8篇
  1980年   5篇
  1979年   11篇
  1978年   7篇
  1977年   7篇
  1976年   2篇
  1975年   9篇
  1974年   7篇
  1973年   5篇
  1972年   7篇
  1971年   4篇
  1970年   4篇
  1969年   6篇
  1968年   3篇
  1967年   2篇
  1966年   3篇
排序方式: 共有379条查询结果,搜索用时 0 毫秒
1.
Suppose X is a random variable having an absolutely continuous distribution function F(x). We assume that F(x) has the Wald distribution. A relation between the probability density function of X−1 with that of X is used to characterize the Wald distribution.  相似文献   
2.
Bayes adaptive control policies are developed in the present paper for the special case of a one-station lower echelon: a Poisson distribution of demand, whose mean is assumed to have a prior gamma distribution. The cost structure is of a common type. The ordering policy for the upper echelon, which minimizes expected cost, is replaced by a new type of policy, called Bayes prediction policy. This policy does not require tedious computations, of the sort required by dynamic programming solutions. The characteristics of the policies are studied by Monte Carlo simulation, and supplemented by further theoretical development.  相似文献   
3.
4.
A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided.  相似文献   
5.
Boland, Proschan, and Tong [2] used the notion of criticality of nodes in a coherent system to study the optimal component arrangement of reliability structures. They also provided a sufficient minimal cut (path) based criterion for verifying the criticality ordering of two nodes. We develop a necessary and sufficient condition for two nodes to be comparable and provide specific examples illustrating our result's applicability. As a corollary, certain optimal arrangement properties of well-known systems are derived. © 1994 John Wiley & Sons, Inc.  相似文献   
6.
A system undergoes minimal repair during [0, T] with a failure replacement on first failure during [T, a], or a planned replacement if the system is still functioning at elapsed time a. Repairs and replacements are not necessarily instantaneous. An expression is obtained for the asymptotic expected cost rate, and sufficient conditions are obtained for the optimum T* > 0. Several special cases are considered. A numerical investigation for a Weibull distributed time to first failure compares this elapsed-time policy with replacement on failure only, and also a policy based on system operating time or age. It is found that in many cases the elapsed-time-based policy is only marginally worse than one based on system age, and may therefore be preferred in view of its administrative convenience. © 1994 John Wiley & Sons, Inc.  相似文献   
7.
This article proposes an interactive paired comparison region elimination method for bicriterion integer mathematical programming problems. The new method isolates the best compromise solution by successively evaluating a pair of associated supported non-dominated solutions. The efficiency of the method is tested by solving randomly generated problems based on varying shapes of efficient frontiers. When compared with the existing branch-and-bound method, the method was effective in reducing the burden on the decision maker. © 1994 John Wiley & Sons, Inc.  相似文献   
8.
Industrial situations exist where it is necessary to estimate the optimum number of parts to start through a manufacturing process in order to obtain a given number of completed good items. The solution to this problem is not straightforward when the expected number of rejects from the process is a random variable and when there are alternative penalties associated with producing too many or too few items. This paper discusses various aspects of this problem as well as some of the proposed solutions to it. In addition, tables of optimum reject allowances based on a comprehensive model are presented.  相似文献   
9.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed.  相似文献   
10.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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