全文获取类型
收费全文 | 522篇 |
免费 | 8篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 72篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 22篇 |
2009年 | 15篇 |
2008年 | 27篇 |
2007年 | 15篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 5篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 16篇 |
1988年 | 4篇 |
1987年 | 12篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有530条查询结果,搜索用时 15 毫秒
131.
132.
We consider optimal test plans involving life distributions with failure‐free life, i.e., where there is an unknown threshold parameter below which no failure will occur. These distributions do not satisfy the regularity conditions and thus the usual approach of using the Fisher information matrix to obtain an optimal accelerated life testing (ALT) plan cannot be applied. In this paper, we assume that lifetime follows a two‐parameter exponential distribution and the stress‐life relationship is given by the inverse power law model. Near‐optimal test plans for constant‐stress ALT under both failure‐censoring and time‐censoring are obtained. We first obtain unbiased estimates for the parameters and give the approximate variance of these estimates for both failure‐censored and time‐censored data. Using these results, the variance for the approximate unbiased estimate of a percentile at a design stress is computed and then minimized to produce the near‐optimal plan. Finally, a numerical example is presented together with simulation results to study the accuracy of the approximate variance given by the proposed plan and show that it outperforms the equal‐allocation plan. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 169–186, 1999 相似文献
133.
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 相似文献
134.
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. 相似文献
135.
We consider the following replacement model in reliability theory. A technical system with random lifetime is replaced upon failure. Preventive replacements can be carried out before failure. The time for such a replacement depends on the observation of a random state parameter and is therefore in general a random time. Different costs for preventive and failure replacements are introduced which may depend on the age of the working system. The optimization criterion followed here to find an optimal replacement time is to minimize the total expected discounted costs. The optimal replacement policy depends on the observation of the state of the system. Results of the theory of stochastic processes are used to obtain the optimal strategy for different information levels. Several examples based on a two-component parallel system with possibly dependent component lifetimes show how the optimal replacement policy depends on the different information levels and on the degree of dependence of the components. © 1992 John Wiley & Sons, Inc. 相似文献
136.
Mehrez, Stern, and Ronen have defined a vehicle refueling problem in which a fleet of vehicles travels on a round-trip, self-contained mission from a common origin, with the objective of maximizing the operational range of the fleet. They have defined a “pure refueling chain” strategy for transferring fuel between vehicles in the fleet, and have solved the problem in the special cases when all vehicles have the same fuel capacity or consumption rate. In this article we present algorithms for the general case, where vehicles have different capacities and consumption rates. Our approach is based on a new primal dual formulation of the problem. The exact algorithm was effective to find the optimal solution for a fleet size n ⩽13. For larger fleets, we present an approximation version of it, which very quickly found a solution within 1% of the maximum possible range for arbitrarily large (up to n = 200) fleets. We also show that a small number of the best vehicles can always reach almost the same range as a large fleet. © 1992 John Wiley & Sons, Inc. 相似文献
137.
We consider the parallel replacement problem in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance costs motivate replacements, and the fixed replacement cost provides incentive for replacing machines of different ages together in “clusters.” We prove two intuitive results for this problem. First, it is never optimal to split a cluster of like-aged machines, and second, it is never optimal to replace newer clusters before older clusters. By incorporating these two results into an algorithmic approach, we vastly reduce the amount of computation required to identify an optimal replacement policy. 相似文献
138.
In this article we present an algorithm for the minimum makespan preemptive open shop, which is superior to existing algorithms in both space and time requirements. We define the more complex generalized open shop and flexible open shop and address the minimum makespan problem on these shops. We show how we can use the algorithm for the minimum makespan open shop to achieve load balancing in simple and generalized open shops without increasing the complexity of the algorithm. Load balancing dictates that the number of busy machines in each period is as even as possible. We also consider preventive maintenance issues in the open shop, and makespan retains its minimum value. In particular we consider the scenario where a machine can be maintained during any period that it happens to be idle. Also we consider the case that a maintenance schedule is prespecified. We show that this problem can be solved via a linear programming formulation that can also take into account release times for the jobs and ready times for the machines. Faster algorithms are presented for open shops with three machines or less. © 1995 John Wiley & Sons, Inc. 相似文献
139.
140.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献