全文获取类型
收费全文 | 553篇 |
免费 | 20篇 |
出版年
2021年 | 8篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 67篇 |
2012年 | 24篇 |
2011年 | 29篇 |
2010年 | 23篇 |
2009年 | 18篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 17篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 5篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 13篇 |
1988年 | 4篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1973年 | 3篇 |
1972年 | 12篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有573条查询结果,搜索用时 15 毫秒
141.
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 相似文献
142.
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 相似文献
143.
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998 相似文献
144.
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. 相似文献
145.
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. 相似文献
146.
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. 相似文献
147.
We schedule a set of illuminators (homing devices) to strike a set of targets using surface-to-air missiles in a naval battle. The task is viewed as a production floor shop scheduling problem of minimizing the total weighted flow time, subject to time-window job availability and machine downtime side constraints. A simple algorithm based on solving assignment problems is developed for the case when all the job processing times are equal and the data are all integer. For the general case of scheduling jobs with unequal processing times, we develop two alternate formulations and analyze their relative strengths by comparing their respective linear programming relaxations. We select the better formulation in this comparison and exploit its special structures to develop several effective heuristic algorithms that provide good-quality solutions in real time; this is an essential element for use by the Navy. © 1995 John Wiley & Sons, Inc. 相似文献
148.
An algorithm is given for the conditional p-center problem, namely, the optimal location of one or more additional facilities in a region with given demand points and one or more preexisting facilities. The solution dealt with here involves the minimax criterion and Euclidean distances in two-dimensional space. The method used is a generalization to the present conditional case of a relaxation method previously developed for the unconditional p-center problems. Interestingly, its worst-case complexity is identical to that of the unconditional version, and in practice, the conditional algorithm is more efficient. Some test problems with up to 200 demand points have been solved. © 1993 John Wiley & Sons, Inc. 相似文献
149.
150.
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. 相似文献