全文获取类型
收费全文 | 267篇 |
免费 | 9篇 |
国内免费 | 1篇 |
出版年
2021年 | 2篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2014年 | 6篇 |
2013年 | 47篇 |
2012年 | 3篇 |
2010年 | 6篇 |
2007年 | 9篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2002年 | 7篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1949年 | 1篇 |
1948年 | 2篇 |
排序方式: 共有277条查询结果,搜索用时 0 毫秒
241.
The minimum makespan of the general parallel machine scheduling problem with m machines and n jobs is studied. As for a number of other important combinatorial problems, the theory of empirical processes proves to be a very elegant and powerful tool for the probabilistic analysis of the solution value. It is used in this paper to derive a scheduling constant θ such that, for random processing times, the minimum makespan almost surely grows as θn when n goes to infinity. Moreover, a thorough probabilistic analysis is performed on the difference between the minimum makespan and θn. Explicit expressions for the scheduling constant are given for an arbitrary number of unrelated machines with identically distributed processing times (with an increasing failure rate), and for an arbitrary number of uniform machines and generally distributed processing times. © 1996 John Wiley & Sons, Inc. 相似文献
242.
Functional equations enable us to arrive at a simple consensus model for fatigue life of longitudinal elements based on engineering principles. The model is then applied to two representative data sets. By the application of proportional hazards techniques and subsequent likelihood analysis, simple parsimonious Weibull models are derived. Inter alia attention is given to the desirability of deriving models exhibiting plausible asymptotic independence. © 1996 John Wiley & Sons, Inc. 相似文献
243.
In this article we consider a stochastic model for two products which have a single-period inventory structure and which can be used as substitutes for each other should the need arise. Substitution will occur with probability one, but at perhaps a different revenue level. We prove that the expected profit function is concave, allowing us to find optimal stocking levels for the two products. We compare optimum inventory levels for the case of single substitution with that where there is no substitution. It is demonstrated for the case of single substitution that total optimum order quantities can actually increase or decrease with the substitution revenue. 相似文献
244.
The bivariate negative binomial distribution of Mitchell and Paulson [17] for the case b = c = 0 is shown to be equivalent to the accident proneness model of Edwards and Gurland [4] and Subrahmaniam [19,20]. The diagonal series expansion of its joint probability function is then derived. Two other formulations of this distribution are also considered: (i) as a mixture model, which showed how it arises as the discrete analogue to the Wicksell-Kibble bivariate gamma distribution, and (ii) as a consequence of the linear birth-and-death process with immigration. 相似文献
245.
Soung H. Kim 《海军后勤学研究》1985,32(3):491-496
In the framework of a discrete Markov decision process with state information lag, this article suggests a way for selecting an optimal policy using the control limit rule. The properties sufficient for an optimal decision rule to be contained in the class of control limit rules are also studied. The degradation in expected reward from that of the perfect information process provides a measure of the potential value of improving the information system. 相似文献
246.
Consider the following situation: Each of N different combat units is presented with a number of requirements to satisfy, each requirement being classified into one of K mutually exclusive categories. For each unit and each category, an estimate of the probability of that unit satisfying any requirement in that category is desired. The problem can be generally stated as that of estimating N different K-dimensional vectors of probabilities based upon a corresponding set of K-dimensional vectors of sample proportions. An empirical Bayes model is formulated and applied to an example from the Marine Corps Combat Readiness Evaluation System (MCCRES). The EM algorithm provides a convenient method of estimating the prior parameters. The Bayes estimates are compared to the ordinary estimates, i.e., the sample proportions, by means of cross validation, and the Bayes estimates are shown to provide considerable improvement. 相似文献
247.
R. H. Baker 《Defense & Security Analysis》1989,5(3):271-274
Izbrannye Proizvedennia. By M. V. Frunze. Moscow (1957) 相似文献
248.
A general result for obtaining recurrence relations between single moments of order statistics is obtained and has been used to establish the recurrence relations between moments of some doubly truncated distributions. The examples considered are Weibull, exponential, Pareto, power function, Cauchy, and logistic. Recurrence relations are also obtained for nontruncated gamma and beta distributions. 相似文献
249.
An empirical Bayes estimator is given for the scale parameter in the two-parameter Weibull distribution. The scale parameter is assumed to vary randomly throughout a sequence of experiments according to a common, but unknown, prior distribution. The shape parameter is assumed to be known, however, it may be different in each experiment. The estimator is obtained by means of a continuous approximation to the unknown prior density function. Results from Monte Carlo simulation are reported which show that the estimator has smaller mean-squared errors than the usual maximum-likelihood estimator. 相似文献
250.
Frederic H. Murphy 《海军后勤学研究》1976,23(3):461-467
An improved theoretical rate of convergence is shown for a member of the class of exponential penalty function algorithms. We show that the algorithm has a superlinear convergence rate. 相似文献