全文获取类型
收费全文 | 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 毫秒
401.
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. 相似文献
402.
In this note we describe a local-search heuristic (LSH) for large non-unicost set-covering problems (SCPs). The new heuristic is based on the simulated annealing algorithm and uses an improvement routine designed to provide low-cost solutions within a reasonable amount of CPU time. The solution costs associated with the LSH compared very favorably to the best previously published solution costs for 20 large SCPs taken from the literature. In particular, the LSH yielded new benchmark solutions for 17 of the 20 test problems. We also report that, for SCPs where column cost is correlated with column coverage, the new heuristic provides solution costs competitive with previously published results for comparable problems. © 1995 John Wiley & Sons, Inc. 相似文献
403.
This article defines and develops a simulation optimization system based upon response surface classification and the integration of multiple search strategies. Response surfaces are classified according to characteristics that indicate which search technique will be most successful. Typical surface characteristics include statistical measures and topological features, while search techniques encompass response surface methodology, simulated annealing, random search, etc. The classify-then-search process flow and a knowledge-based architecture are developed and then demonstrated with a detailed computer example. The system is useful not only as an approach to optimizing simulations, but also as a means for integrating search techniques and thereby providing the user with the most promising path toward an optimal solution. © 1995 John Wiley & Sons, Inc. 相似文献
404.
W. E. Wallace 《海军后勤学研究》1985,32(1):21-26
MIL-STD-781 specifies reliability acceptance test procedures based on both fixed-length tests and probability ratio sequential tests. The assumption underlying MIL-STD-781 is a constant mean time between failures (MTBF) and typical practice applies MIL-STD-781 to electrical, electronic, and mechanical equipment. This article discusses some of the difficulties that have prompted the C and D revisions of MIL-STD-781. In addition, it discusses the relationship of MIL-STD-781 with MIL-STD-1635(EC) which deals with reliability growth testing. The article concludes with a discussion of needed research in reliability growth testing, in support of MIL-STD-781, and in the area of stress and its impact of MTBF. 相似文献
405.
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. 相似文献
406.
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. 相似文献
407.
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. 相似文献
408.
409.
Edward W. Frees 《海军后勤学研究》1986,33(3):361-372
Estimation of the expected cost of a warranty for a stochastically failing unit is closely tied to estimation of the renewal function. The renewal function is a basic tool also used in probabilistic models arising in other areas such as reliability theory, inventory theory, and continuous sampling plans. In these other areas, estimation of a straight line approximation of the renewal function instead of direct estimation of the renewal function has proved successful. This approximation is based on a limit expression for large values of the argument, say t, of the renewal function. However, in warranty analusis, typically t is small compared to the mean failure time of the unit. Hence, alternative methods for renewal function estimation, both parametric and nonparametric, are presented and discussed. An important aspect of this paper is to discuss the performance of the renewal function estimators when only a small number of failed units is available. A Monte Carlo study is given which suggests guidelines for choosing an estimator under various circumstances. 相似文献
410.
R. H. Baker 《Defense & Security Analysis》1989,5(3):271-274
Izbrannye Proizvedennia. By M. V. Frunze. Moscow (1957) 相似文献