全文获取类型
收费全文 | 729篇 |
免费 | 14篇 |
出版年
2020年 | 6篇 |
2019年 | 16篇 |
2017年 | 24篇 |
2016年 | 18篇 |
2015年 | 19篇 |
2014年 | 22篇 |
2013年 | 141篇 |
2012年 | 8篇 |
2011年 | 9篇 |
2010年 | 13篇 |
2009年 | 16篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 11篇 |
2004年 | 13篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 5篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 19篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 19篇 |
1987年 | 17篇 |
1986年 | 21篇 |
1985年 | 16篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 9篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有743条查询结果,搜索用时 109 毫秒
181.
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. 相似文献
182.
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. 相似文献
183.
184.
Gerald G. Brown Kelly J. Cormican Siriphong Lawphongpanich Daniel B. Widdis 《海军后勤学研究》1997,44(4):301-318
Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997. 相似文献
185.
The problem of determining the sample sizes in various strata when several characteristics are under study is formulated as a nonlinear multistage decision problem. Dynamic programming is used to obtain an integer solution to the problem. © 1997 John Wiley & Sons, Inc. 相似文献
186.
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 相似文献
187.
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 相似文献
188.
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 相似文献
189.
Starting from a safe base, an Infiltrator tries to reach a sensitive zone within a given time limit without being detected by a Guard. The Infiltrator can move with speed at most u, while the Guard can only perform a restricted number of searches. A discrete variant of this zero-sum game played on a graph consisting of two vertices joined by n nonintersecting arcs is investigated. Optimal strategies and an explicit expression for its value are obtained. © 1996 John Wiley & Sons, Inc. 相似文献
190.
We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed. 相似文献