全文获取类型
收费全文 | 469篇 |
免费 | 12篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 100篇 |
2012年 | 4篇 |
2010年 | 8篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 10篇 |
1972年 | 7篇 |
1971年 | 9篇 |
1969年 | 7篇 |
1968年 | 10篇 |
1967年 | 4篇 |
1966年 | 4篇 |
1948年 | 5篇 |
排序方式: 共有482条查询结果,搜索用时 15 毫秒
411.
For multiresponse simulations requiring point and confidence-region estimators of the mean response, we propose control-variate selection criteria that minimize mean-square confidence-region volume in two situations: (a) Only the mean control vector is known, and standard linear control-variate estimation procedures are used. (b) Covariances among controls are also known and are incorporated into new linear control-variate estimation procedures. An example illustrates the performance of these selection criteria. 相似文献
412.
413.
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. 相似文献
414.
One way of achieving the increased levels of system reliability and availability demanded by critical computer-based control systems is through the use of fault-tolerant distributed computer systems. This article addresses the problem of allocating a set of m tasks among a set of n processors in a manner that will satisfy various task assignment, system capacity, and task scheduling constraints while balancing the workload across processors. We discuss problem background, problem formulation, and a known heuristic procedure for the problem. A new solution-improving heuristic procedure is introduced, and computational experience with the heuristics is presented. With only a modest increase in the amount of computational effort, the new procedure is demonstrated to improve dramatically solution quality as well as obtain near-optimal solutions to the test problems. 相似文献
415.
This article proposes a practical, data-based statistical procedure which can be used to reduce or remove bias owing to artificial startup conditions in simulations aimed at estimating steady-state means. We discuss results of experiments designed to choose good parameter values for this procedure, and present results of extensive testing of the procedure on a variety of stochastic models for which partial analytical results are available. The article closes with two illustrations of the application of the procedure to more complex statistical problems which are more representative of the kinds of purposes for which real-world steady-state simulation studies might be undertaken. 相似文献
416.
A model for a vehicle moving evasively along a fixed path is defined in terms of a two- state semi-Markov process. An important feature of this model is the continuous movement of the vehicle as a function of time. One potential application of this model is the development of a strategy for the deployment of long-range missiles on long underground tracks. 相似文献
417.
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. 相似文献
418.
Initial provisioning decisions (inventory stocking requirements) for low demand items often have to be made without much knowledge of what future demand rates will be. When the nature of an item is such that little demand for it is expected, the problem of whether to stock initially or risk not stocking the item is most critical. This report discusses this problem and presents decision procedures which can be used to handle this aspect of initial provisioning. The procedures relate an item's provisioning desirability to its provisioning characteristics, such as expected cost, expected resupply time, current information on its likely demand rate, and to an overall operating policy or criterion. The criterion function measures the total system degredation as a function of the events of having items out of stock when demand occurs. Several different policy functions are discussed and the provisioning decision rules which apply to each are presented. Demand rate information is handled through a Bayesian type approach. The decision rules presented in this report can be utilized to either determine stocking requirements within a budgetary constraint, or determine the relative stocking desirability on an item-by-item basis. 相似文献
419.
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. 相似文献
420.
W. A. Horn 《海军后勤学研究》1974,21(1):177-185
This paper considers situations in which jobs require only one operation on a single machine, or on one of a set of identical machines. Penalty-free interruption is allowed. Some simple algorithms are given for finding optimum schedules to minimize maximum lateness and total delay, for the single-machine case, and maximum lateness for a restricted multi-machine case. A simple flow problem formulation permits minimizing maximum lateness for the more general multimachine case. 相似文献