全文获取类型
收费全文 | 315篇 |
免费 | 5篇 |
出版年
2020年 | 5篇 |
2019年 | 9篇 |
2018年 | 8篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 6篇 |
2014年 | 5篇 |
2013年 | 94篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 6篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1970年 | 3篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有320条查询结果,搜索用时 15 毫秒
61.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
62.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
63.
James G. Taylor 《海军后勤学研究》1973,20(4):673-697
We develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear-law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition-rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition process. 相似文献
64.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
65.
66.
67.
We propose three related estimators for the variance parameter arising from a steady‐state simulation process. All are based on combinations of standardized‐time‐series area and Cramér–von Mises (CvM) estimators. The first is a straightforward linear combination of the area and CvM estimators; the second resembles a Durbin–Watson statistic; and the third is related to a jackknifed version of the first. The main derivations yield analytical expressions for the bias and variance of the new estimators. These results show that the new estimators often perform better than the pure area, pure CvM, and benchmark nonoverlapping and overlapping batch means estimators, especially in terms of variance and mean squared error. We also give exact and Monte Carlo examples illustrating our findings.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
68.
Andrew W. Shogan 《海军后勤学研究》1979,26(3):487-497
This paper considers a single server queueing system that alternates stochastically between two states: operational and failed. When operational, the system functions as an M/Ek/1 queue. When the system is failed, no service takes place but customers continue to arrive according to a Poisson process; however, the arrival rate is different from that when the system is operational. The durations of the operating and failed periods are exponential with mean 1/cβ and Erlang with mean 1/cβ, respectively. Generating functions are used to derive the steady-state quantities L and W, both of which, when viewed as functions of c, decrease at a rate inversely proportional to c2. The paper includes an analysis of several special and extreme cases and an application to a production-storage system. 相似文献
69.
James R. Evans 《海军后勤学研究》1978,25(1):31-37
The simplex method is interpreted as a labeling procedure for certain classes of multicommodity flow problems in a manner similar to that for single commodity networks. As opposed to general multicommodity algorithms, no explicit matrix inversion is required; all simplex operations are performed graph-theoretically. 相似文献
70.
James G. Taylor 《海军后勤学研究》1978,25(2):323-355
Optimal time-sequential fire-support strategies are studied through a two-person zero-sum deterministic differential game with closed-loop (or feedback) strategies. Lanchester-type equations of warfare are used in this work. In addition to the max-min principle, the theory of singular extremals is required to solve this prescribed-duration combat problem. The combat is between two heterogeneous forces, each composed of infantry and a supporting weapon system (artillery). In contrast to previous work reported in the literature, the attrition structure of the problem at hand leads to force-level-dependent optimal fire-support strategies with the attacker's optimal fire-support strategy requiring him to sometimes split his artillery fire between enemy infantry and artillery (counterbattery fire). A solution phenomnon not previously encountered in Lanchester-type differential games is that the adjoint variables may be discontinuous across a manifold of discontinuity for both players' strategies. This makes the synthesis of optimal strategies particularly difficult. Numerical examples are given. 相似文献