全文获取类型
收费全文 | 440篇 |
免费 | 15篇 |
国内免费 | 1篇 |
出版年
2021年 | 10篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2014年 | 10篇 |
2013年 | 70篇 |
2012年 | 6篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1973年 | 8篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有456条查询结果,搜索用时 15 毫秒
411.
In this article we present an optimum maintenance policy for a group of machines subject to stochastic failures where the repair cost and production loss due to the breakdown of machines are minimized. A nomograph was developed for machines with exponential failure time distributions. The optimal schedule time for repair as well as the total repair cost per cycle can be obtained easily from the nomograph. Conditions for the existence of a unique solution for the optimum schedule and the bounds for the schedule are discussed. 相似文献
412.
413.
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. 相似文献
414.
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. 相似文献
415.
The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained. 相似文献
416.
A methodology is developed for assessing tactical airfield/aircraft system effectiveness, and for evaluating effectiveness changes resulting from incremental investments in ground support resources and/or aircraft reliability. Two categories of ground support functions–turnaround and maintenance–are distinguished. The measure of effectiveness is the maximum potential sortie rate achievable by the system. The methodology enables empirical derivation of the general equation of the tactical airfield/aircraft system. It also enables graphical presentation of the system tradeoffs in the form of a System Analysis Chart. 相似文献
417.
418.
The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors. 相似文献
419.
K. M. Mjelde 《海军后勤学研究》1977,24(4):639-650
The paper describes an approach to the evaluation of the effectiveness of a minefield in terms of the number of mines that are detonated by a convoy of sweepers and ships and the corresponding number of vessels that are immobilized. The positions of the mines and the tracks of the vessels are assumed to be known, which means that the evaluation measures are dependent on a large number of disjoint events, each event being the immobilization of particular vessels by particular mines. This may render combinatorial methods computationally infeasible, but by introducing approximations in the assumptions, the difficulty can be overcome, specifically by modelling the arrival of each individual vessel in the neighborhood of a mine by an inhomogeneous Poisson stream for which the arrival rate is nonzero only over a short time interval. The plausibility of the approach is supported by results of a critical-event simulation model. 相似文献
420.
The dynamic transportation problem is a transportation problem over time. That is, a problem of selecting at each instant of time t, the optimal flow of commodities from various sources to various sinks in a given network so as to minimize the total cost of transportation subject to some supply and demand constraints. While the earliest formulation of the problem dates back to 1958 as a problem of finding the maximal flow through a dynamic network in a given time, the problem has received wider attention only in the last ten years. During these years, the problem has been tackled by network techniques, linear programming, dynamic programming, combinational methods, nonlinear programming and finally, the optimal control theory. This paper is an up-to-date survey of the various analyses of the problem along with a critical discussion, comparison, and extensions of various formulations and techniques used. The survey concludes with a number of important suggestions for future work. 相似文献