全文获取类型
收费全文 | 586篇 |
免费 | 16篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 5篇 |
2017年 | 18篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 16篇 |
2013年 | 117篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 5篇 |
2002年 | 11篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 15篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 17篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有602条查询结果,搜索用时 31 毫秒
201.
The manufacturing process for a computer chip is complex in that it involves a large number of distinct operations requiring a substantial lead‐time for completion. Our observations of such a manufacturing process at a large plant in the United States led us to identify several tactical and operational problems that were being addressed by the production planners on a recurring basis. This paper focuses on one such problem. At a tactical level, given a demand forecast of wafers to be manufactured, one specific problem deals with specifying which machine or machine groups will process different batches of wafers. We address this problem by recognizing the capacity limitations of the individual machines as well as the requirement for reducing operating and investment costs related to the machines. A mathematical model, which is a variation of the well‐known capacitated facility location problem, is proposed to solve this problem. Given the intractability of the model, we first develop problem specific lower bounding procedures based on Lagrangean relaxation. We also propose a heuristic method to obtain “good” solutions with reasonable computational effort. Computational tests, using hypothetical and industry‐based data, indicate that our heuristic approach provides optimal/near optimal solutions fairly quickly. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
202.
Stephen J. Cimbala 《Defense & Security Analysis》2012,28(1):65-80
Minimum deterrence is a compromise, or halfway house, between nuclear abolition or nearly zero and assured destruction, the dominant paradigm for strategic nuclear arms control during and after the cold war. Minimum deterrence as applied to the current relationship between the United States and Russia would require downsizing the numbers of operationally deployed long-range nuclear weapons to 1000, or fewer, on each side. More drastic bilateral Russian–American reductions would require the cooperation of other nuclear weapons states in making proportional reductions in their own arsenals. In addition, US plans for European-based and global missile defenses cause considerable angst in Russia and threaten to derail the Obama “reset” in Russian–American relations, despite the uncertainties about current and plausible future performances of missile defense technologies. 相似文献
203.
Leo J. Blanken 《Defense & Security Analysis》2012,28(4):275-287
Three distinct, and seemingly irreconcilable, schools of thought are identified within the strategic studies literature. One which searches for “universal principles of war,” a second, “context-dependent,” approach that seeks to embed each instance of warfare within its concurrent social, political, technological milieu and, finally a “paradoxical logic” school, which equates strategy with the generation of uncertainty. The author offers some intuitive concepts from non-cooperative game theory to develop a “dominate-mix” approach to strategy choice. In doing so, he helps to reconcile these disparate approaches and provides a simple framework to assist researchers in framing military decisions as well as to assist planners in choosing among strategies. 相似文献
204.
205.
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. 相似文献
206.
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. 相似文献
207.
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. 相似文献
208.
Let X be a positive random variable. The distribution F of X is said to be “new better than used in expectation,” or “NBUE,” if E(X) ⩾ E(X – t|X > t) for all t ⩾ 0. Suppose X1, …, Xn, is a random sample from an NBUE distribution F. The problem of estimating F by a distribution which is itself NBUE is considered. The estimator Gn, defined as the NBUE distribution supported on the sample which minimizes the (sup norm) distance between the NBUE class and the empirical distribution function, is studied. The strong uniform consistency of Gn, is proven, and a numerical algorithm for obtaining Gn, is given. Our approach is applied to provide an estimate of the distribution of lifetime following the diagnosis of chronic granulocytic leukemia based on data from a National Cancer Institute study. 相似文献
209.
The article considers a two-person zero-sum game in which a searcher with b bombs wishes to destroy a mobile hider. The players are restricted to move on a straight line with maximum speeds v and u satisfying v > u > 0; neither player can see the other but each knows the other's initial position. The bombs all have destructive radius R and there is a time lag T between the release of a bomb and the bomb exploding. The searcher gets 1 unit if the hider is destroyed and 0 if he survives. A solution is given for b = 1, and extended to b > 1 when the time lag is small. Various applications of the game are discussed. 相似文献
210.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献