全文获取类型
收费全文 | 605篇 |
免费 | 0篇 |
专业分类
605篇 |
出版年
2020年 | 5篇 |
2019年 | 14篇 |
2018年 | 7篇 |
2017年 | 20篇 |
2016年 | 11篇 |
2015年 | 15篇 |
2014年 | 17篇 |
2013年 | 121篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 11篇 |
2007年 | 7篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 14篇 |
1988年 | 15篇 |
1987年 | 15篇 |
1986年 | 16篇 |
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年 | 9篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有605条查询结果,搜索用时 0 毫秒
321.
322.
We consider the problem of deciding whether to keep a piece of equipment or replace it with a more advanced technology in an environment of technological change. Our model assumes that the costs associated with the presently available technology and future technologies are known, but that the appearance times of future technologies are uncertain. We develop a procedure for computing the optimal keep-or-replace decision that iteratively incorporates a technological forecast. For a certain class of situations, we show that our approach requires the minimum possible amount of forecasted data. 相似文献
323.
We describe a decision process for establishing the threshold reliabilities for components of naval major-caliber ammunition. We present a measure of reliability performance, called ef*, which relates directly to the weapons system's performance in a naval gunfire support environment. We use a simulation model to establish this relationship, a regression metamodel to estimate its parameters, and a simple decision process to specify component reliability thresholds which ensure that the ammunition is mission effective. We present this article as an example of the integration of discrete event dynamic system analysis within a decision process. © 1992 John Wiley & Sons, Inc. 相似文献
324.
325.
326.
327.
328.
Alexander S. Kolbin 《The Nonproliferation Review》2014,21(2):229-238
In yet another wave of discussion on nuclear disarmament among political scientists and practitioners, one of the topical issues concerns the problem of transparency, its mechanisms, costs, and benefits. Numerous—though often abstract—calls for greater transparency of nuclear arsenals and postures when promoting the idea of nuclear disarmament, however, do not give a clear rationale for states possessing nuclear weapons to pursue greater transparency. Meanwhile, many other research fields—such as economics and psychology—attempt to address problems related to the lack of exact information on the counterpart's activities and intentions. Economics offers one probable analog for the transparency problem: the issue of information asymmetry and its consequences. This article is an attempt to apply the classical model of a market with information asymmetry to the analysis of the transparency problem within the nuclear disarmament process. Such an approach could help pave the way for closer cooperation between economic and political scientists in the nuclear disarmament field. 相似文献
329.
We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001 相似文献
330.
Antoon W.J. Kolen Jan Karel Lenstra Christos H. Papadimitriou Frits C.R. Spieksma 《海军后勤学研究》2007,54(5):530-543
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献