全文获取类型
收费全文 | 957篇 |
免费 | 16篇 |
出版年
2019年 | 18篇 |
2018年 | 10篇 |
2017年 | 27篇 |
2016年 | 17篇 |
2015年 | 18篇 |
2014年 | 19篇 |
2013年 | 209篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 11篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 7篇 |
2000年 | 11篇 |
1999年 | 11篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 14篇 |
1995年 | 14篇 |
1994年 | 22篇 |
1993年 | 20篇 |
1992年 | 15篇 |
1991年 | 24篇 |
1990年 | 14篇 |
1989年 | 19篇 |
1988年 | 23篇 |
1987年 | 25篇 |
1986年 | 25篇 |
1985年 | 21篇 |
1984年 | 10篇 |
1983年 | 13篇 |
1982年 | 17篇 |
1981年 | 12篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 14篇 |
1972年 | 14篇 |
1971年 | 11篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1968年 | 10篇 |
1967年 | 10篇 |
排序方式: 共有973条查询结果,搜索用时 31 毫秒
21.
22.
24.
Classical inventory models generally assume either no backlogging of demands or unlimited backlogging. This paper treats the case wherein backlogged customers are willing to wait for a random period of time for service. A broad class of such models is discussed, with a more complete analysis performed on a simple subclass. Steady state equations are derived and solved assuming exponentially distributed interarrival times of customers, order delivery lead times, and customer patience. 相似文献
25.
This paper calls attention to an experimental design which enhances the efficiency of the technique described by B. F. Houston and R. A. Huffman [3]. This alternative design is a modification of the simplex lattice design developed by Scheffé [6] for the mixture problem. While not possessing the optimal statistical properties of the central composite design proposed in [3], such as minimum bias and minimum variance, this modified design is optimum with respect to the number of design points employed; hence, it is the minimum cost design. Further, the design proposed in this note is excellent for use in multiple-block experimentation, which is very often required with constrained systems. 相似文献
26.
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. 相似文献
27.
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. 相似文献
28.
Robert R. Read 《海军后勤学研究》1969,16(4):555-572
The paper treats the output process of a service center that has a large number of independent exponential channels in parallel. Initially all channels are working and there is a fixed backlog of items awaiting service. The moments are derived and central limit theorems are developed. Problems of computation are discussed and suitable formulae are developed. The joint distribution of the output of the center with the center's total busy time and total idle time are derived. Normal approximations to these distributions are presented. 相似文献
29.
30.
We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi-infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n-space with maximization of a linear function in non-negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn-Tucker saddle-point equivalence theorem for arbitrary convex functions in n-space where differentiability is no longer assumed. 相似文献