全文获取类型
收费全文 | 399篇 |
免费 | 5篇 |
出版年
2020年 | 8篇 |
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 14篇 |
2016年 | 11篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 127篇 |
2011年 | 3篇 |
2010年 | 4篇 |
2009年 | 4篇 |
2008年 | 5篇 |
2007年 | 3篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 10篇 |
1991年 | 12篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 6篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1968年 | 2篇 |
1967年 | 3篇 |
排序方式: 共有404条查询结果,搜索用时 0 毫秒
361.
Paul Bracken 《Defense & Security Analysis》1986,2(1):11-20
“Even more than in 1914, governments in our own day are likely to be ignorant of the technical detail of war and the tactical measures that can or cannot (or, more important, must or must not) be taken in various specialized situations. In peacetime the study and preparation of these measures will be relegated to military staffs as being narrow and technical. Today, .... it is almost impossible to get people interested in the tactics and strategy of thermonuclear war. It is now believed that only the prewar moves are of interest, and even those are not too important because deterrence is supposed to be so close to 'automatic'.” Herman Kahn (1960). 相似文献
362.
A model for a vehicle moving evasively along a fixed path is defined in terms of a two- state semi-Markov process. An important feature of this model is the continuous movement of the vehicle as a function of time. One potential application of this model is the development of a strategy for the deployment of long-range missiles on long underground tracks. 相似文献
363.
James A. M. McHugh 《海军后勤学研究》1984,31(3):409-411
This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available. 相似文献
364.
Consider a central depot that supplies several locations experiencing random demands. Periodically, the depot may place an order for exogenous supply. Orders arrive after a fixed leadtime, and are then allocated among the several locations. Each allocation reaches its destination after a further delay. We consider the special case where the penalty-cost/holding-cost ratio is constant over the locations. Several approaches are given to approximate the dynamic program describing the problem. Each approach provides both a near-optimal order policy and an approximation of the optimal cost of the original problem. In addition, simple but effective allocation policies are discussed. 相似文献
365.
James G. Taylor 《海军后勤学研究》1972,19(3):539-556
A complete solution is derived to the Isbell and Marlow fire programming problem. The original work of Isbell and Marlow has been extended by determining the regions of the initial state space from which optimal paths lead to each of the terminal states of combat. The solution process has involved determining the domain of controllability for each of the terminal states of combat and the determination of dispersal surfaces. This solution process suggests a solution procedure applicable to a wider class of tactical allocation problems, terminal control attrition differential games. The structure of optimal target engagement policies in “fights to the finish” is discussed. 相似文献
366.
Paul D. Berger 《海军后勤学研究》1972,19(1):159-164
This paper poses a prediction problem in which a linear model is assumed. With a “zero-one” loss structure as the loss from incorrect prediction, it is suggested that least squares may not be appropriate for estimating the parameters of the model. An alternate criterion is proposed and integer programming is used in order to find the estimates, given the proposed criterion. 相似文献
367.
We consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time ai, must be completed by time bi, and requires di time units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply. 相似文献
368.
The discounted return associated with a finite state Markov chain X1, X2… is given by g(X1)+ αg(X2) + α2g(X3) + …, where g(x) represents the immediate return from state x. Knowing the transition matrix of the chain, it is desired to compute the expected discounted return (present worth) given the initial state. This type of problem arises in inventory theory, dynamic programming, and elsewhere. Usually the solution is approximated by solving the system of linear equations characterizing the expected return. These equations can be solved by a variety of well-known methods. This paper describes yet another method, which is a slight modification of the classical iterative scheme. The method gives sequences of upper and lower bounds which converge mono-tonely to the solution. Hence, the method is relatively free of error control problems. Computational experiments were conducted which suggest that for problems with a large number of states, the method is quite efficient. The amount of computation required to obtain the solution increases much slower with an increase in the number of states, N, than with the conventional methods. In fact, computational time is more nearly proportional to N2, than to N3. 相似文献
369.
James G. Taylor 《海军后勤学研究》1976,23(2):345-352
A “local” condition of winning (in the sense that the force ratio is changing to the advantage of one of the combatants) is shown to apply to all deterministic Lanchester-type models with two force-level variables. This condition involves the comparison of only the force ratio and the instantaneous force-change ratio. For no replacements and withdrawals, a combatant is winning “instantaneously” when the force ratio exceeds the differential casualty-exchange ratio. General outcome-prediction relations are developed from this “local” condition and applied to a nonlinear model for Helmbold-type combat between two homogeneous forces with superimposed effects of supporting fires not subject to attrition. Conditions under which the effects of the supporting fires “cancel out” are given. 相似文献
370.