全文获取类型
收费全文 | 768篇 |
免费 | 15篇 |
出版年
2019年 | 15篇 |
2017年 | 21篇 |
2016年 | 13篇 |
2015年 | 16篇 |
2014年 | 16篇 |
2013年 | 159篇 |
2012年 | 6篇 |
2011年 | 6篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 10篇 |
2005年 | 12篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 21篇 |
1985年 | 17篇 |
1984年 | 9篇 |
1983年 | 10篇 |
1982年 | 15篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 13篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 12篇 |
1973年 | 12篇 |
1972年 | 13篇 |
1971年 | 10篇 |
1970年 | 12篇 |
1969年 | 10篇 |
1968年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有783条查询结果,搜索用时 0 毫秒
191.
T. J. Stewart 《海军后勤学研究》1981,28(3):393-406
A form of sequential decision problem is introduced in which options are presented in sequence. with no recall of rejected options (as in the secretary problem), but in which the value of each option may only he inferred from experiments. Decisions have thus to be made concerning both the acceptance and rejection of each option and the degree of experimentation. General properties of the optimal policy are derived, and an algorithm is obtained for the solution in a special case. This special case suggests a heuristic rule for more general situations. the performance of which rule has been investigated by a Monte Carlo study. 相似文献
192.
Gary J. Koehler 《海军后勤学研究》1981,28(1):83-92
In discounted Markov decision processes bounds on the optimal value function can be computed and used to eliminate suboptimal actions. In this paper we extend these procedures to the generalized Markov decision process. In so doing we forfeit the contraction property and must base our analysis on other procedures. Duality theory and the Perron-Frobenius theorem are the main tools. 相似文献
193.
M. J. M. Jansen 《海军后勤学研究》1981,28(1):147-152
In this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived. 相似文献
194.
This paper is concerned with the statistical test plans contained in Military Standard 781C, “Reliability Design Qualification and Production Acceptance Tests: Exponential Distribution” and the selection and use of these plans. Modifications to the fixed-length test plans of MIL-STD-781C are presented which allow early-accept decisions to be made without sacrificing statistical validity. The proposed plans differ from the probability ratio sequential tests in the Standard in that rejection is permitted only after a fixed number of failures have been observed. 相似文献
195.
In this paper, we consider approximations to discrete time Markov chains with countably infinite state spaces. We provide a simple, direct proof for the convergence of certain probabilistic quantities when one uses a northwest corner or a banded matrix approximation to the original probability transition matrix. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 187–197, 1999 相似文献
196.
Consider a simulation experiment consisting of v independent vector replications across k systems, where in any given replication one system is selected as the best performer (i.e., it wins). Each system has an unknown constant probability of winning in any replication and the numbers of wins for the individual systems follow a multinomial distribution. The classical multinomial selection procedure of Bechhofer, Elmaghraby, and Morse (Procedure BEM) prescribes a minimum number of replications, denoted as v*, so that the probability of correctly selecting the true best system (PCS) meets or exceeds a prespecified probability. Assuming that larger is better, Procedure BEM selects as best the system having the largest value of the performance measure in more replications than any other system. We use these same v* replications across k systems to form (v*)k pseudoreplications that contain one observation from each system, and develop Procedure AVC (All Vector Comparisons) to achieve a higher PCS than with Procedure BEM. For specific small-sample cases and via a large-sample approximation we show that the PCS with Procedure AVC exceeds the PCS with Procedure BEM. We also show that with Procedure AVC we achieve a given PCS with a smaller v than the v* required with Procedure BEM. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 459–482, 1998 相似文献
197.
This paper considers the maintenance of aircraft engine components where economies exist for joint replacement because (a) the aircraft must be pulled from service for maintenance and (b) repair of some components requires removal and disassembly of the engine. It is well known that the joint replacement problem is difficult to solve exactly, because the optimal solution does not have a simple structured form. Therefore, we formulate three easy-to-implement heuristics and test their performance against a lower bound for various numerical examples. One of our heuristics, the base interval approach, in which replacement cycles for all components are restricted to be multiples of a specified interval, is shown to be robustly accurate. Moreover, this heuristic is consistent with maintenance policies used by commercial airlines in which periodic maintenance checks are made at regular intervals. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 435–458, 1998 相似文献
198.
J. S. Dagpunar 《海军后勤学研究》1998,45(4):391-405
We consider a general repair process where the virtual age Vi after the ith repair is given by Vi = ϕ(Vi−1 + Xi), ϕ(·) is a specified repair functional, and Xi is the time between the (i − 1)th and ith repair. Some monotonicity and dominance properties are derived, and an equilibrium process is considered. A computational method for evaluating the expected number/density of repairs is described together with an approximation method for obtaining some parameters of the equilibrium process. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 391–405, 1998 相似文献
199.
This article investigates inference for pmax, the largest cell probability in multinomial trials for the case of a small to moderate number of trials. Emphasis focuses on point and interval estimation. Both frequentist and Bayesian approaches are developed. The results of extensive simulation investigation are included as well as the analysis of a set of crime data for the city of New Orleans taken from the National Crime Survey. 相似文献
200.
The steady-state workload at an arbitrary time is considered for several single-server queueing systems with nonpreemptive services for multiple classes of customers (arriving according to Poisson processes) and server vacation (switchover) times. The distribution of the workload at an arbitrary point during the vacation period is obtained for systems with setup times, and for polling systems with exhaustive, gated, or globally gated service disciplines. From the stochastic decomposition property, this workload is added to the workload in the corresponding M/G/1 system without vacations to give the workload at an arbitrary time in vacation systems. Dependence of the workload distribution on the vacation parameters is studied. 相似文献