全文获取类型
收费全文 | 456篇 |
免费 | 14篇 |
出版年
2019年 | 10篇 |
2018年 | 12篇 |
2017年 | 11篇 |
2016年 | 10篇 |
2015年 | 10篇 |
2014年 | 6篇 |
2013年 | 92篇 |
2012年 | 3篇 |
2011年 | 5篇 |
2009年 | 9篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 10篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1997年 | 5篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 17篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 14篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 9篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 8篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有470条查询结果,搜索用时 15 毫秒
261.
The simulations that many defense analysts rely upon in their studies continue to grow in size and complexity. This paper contrasts the guidance that the authors have received—from some of the giants of military operations research—with the current practice. In particular, the analytic utility of Hughes' simple salvo equations is compared with that of the complex Joint Warfighting System (JWARS), with respect to JWARS' key performance parameters. The comparison suggests that a family of analytic tools supports the best analyses. It follows that smaller, more agile, and transparent models, such as Hughes' salvo equations, are underutilized in defense analyses. We believe that these models should receive more attention, use, and funding. To illustrate this point, this paper uses two very simple models (by modern standards) to rapidly generate insights on the value of information relative to force strength. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
262.
263.
264.
Warren B. Powell 《海军后勤学研究》2009,56(3):239-249
Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
265.
266.
提出了一种线性分组码的最大似然译码(ML-decoding)差错概率下界的计算方法。差错概率的下界优化实质上是对联合事件概率下界的优化,算法结合改进的Dawson-Sankoff界的优化准则,提出了AWGN信道下线性分组码差错冗余事件的判决准则,得到了误码率下界的计算表达式。该表达式只依赖码字的Hamming重量分布与信噪比,较之类deCaens界与类KAT界,本算法得到的下界更紧,计算量更低。针对LDPC等线性分组码的数值结果证明了算法的优越性能。 相似文献
267.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
268.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001 相似文献
269.
Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
270.
In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made. 相似文献