全文获取类型
收费全文 | 741篇 |
免费 | 18篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 18篇 |
2013年 | 134篇 |
2012年 | 7篇 |
2010年 | 10篇 |
2009年 | 17篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 11篇 |
2004年 | 16篇 |
2002年 | 17篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 7篇 |
1998年 | 15篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 11篇 |
1994年 | 17篇 |
1993年 | 16篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 20篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 10篇 |
1973年 | 11篇 |
1972年 | 11篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1967年 | 6篇 |
排序方式: 共有759条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
23.
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. 相似文献
24.
Alan J. Kaplan 《海军后勤学研究》1970,17(2):253-258
This paper is concerned with the optimum decision variables found using order quantity, reorder point (Q, R) inventory models. It examines whether the optimum variables (Q* and R*) are necessarily monotonic functions of the backorder cost parameter (or equivalently of the performance objective). For a general class of models it is proved that R* must increase as the performance objective is raised, and an inequality condition is derived which governs how Q* will change. Probability distributions of lead time demand are cited or found for which Q* increases, Q* decreases, and Q* is independent of increases in performance objectives or backorder cost parameter. 相似文献
25.
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. 相似文献
26.
27.
28.
A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rn | a < Ax < b, a, b ε Rm} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program. 相似文献
29.
Consider an auction in which increasing bids are made in sequence on an object whose value θ is known to each bidder. Suppose n bids are received, and the distribution of each bid is conditionally uniform. More specifically, suppose the first bid X1 is uniformly distributed on [0, θ], and the ith bid is uniformly distributed on [Xi?1, θ] for i = 2, …?, n. A scenario in which this auction model is appropriate is described. We assume that the value θ is un known to the statistician and must be esimated from the sample X1, X2, …?, Xn. The best linear unbiased estimate of θ is derived. The invariance of the estimation problem under scale transformations in noted, and the best invariant estimation problem under scale transformations is noted, and the best invariant estimate of θ under loss L(θ, a) = [(a/θ) ? 1]2 is derived. It is shown that this best invariant estimate has uniformly smaller mean-squared error than the best linear unbiased estimate, and the ratio of the mean-squared errors is estimated from simulation experiments. A Bayesian formulation of the estimation problem is also considered, and a class of Bayes estimates is explicitly derived. 相似文献
30.
Adequate prediction of a response variable using a multiple linear regression model is shown in this article to be related to the presence of multicollinearities among the predictor variables. If strong multicollinearities are present in the data, this information can be used to determine when prediction is likely to be accurate. A region of prediction, R, is proposed as a guide for prediction purposes. This region is related to a prediction interval when the matrix of predictor variables is of full column rank, but it can also be used when the sample is undersized. The Gorman-Toman ten-variable data is used to illustrate the effectiveness of the region R. 相似文献