全文获取类型
收费全文 | 720篇 |
免费 | 22篇 |
国内免费 | 1篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 11篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 149篇 |
2010年 | 9篇 |
2009年 | 8篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 20篇 |
1995年 | 9篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 20篇 |
1990年 | 8篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 17篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 21篇 |
1979年 | 12篇 |
1978年 | 17篇 |
1976年 | 13篇 |
1975年 | 17篇 |
1974年 | 11篇 |
1973年 | 15篇 |
1972年 | 9篇 |
1971年 | 15篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 11篇 |
1966年 | 12篇 |
排序方式: 共有743条查询结果,搜索用时 15 毫秒
161.
Lawrence D. Stone 《海军后勤学研究》1973,20(3):419-430
This paper considers the problem of finding optimal solutions to a class of separable constrained extremal problems involving nonlinear functionals. The results are proved for rather general situations, but they may be easily stated for the case of search for a stationary object whose a priori location distribution is given by a density function on R, a subset of Euclidean n-space. The functional to be optimized in this case is the probability of detection and the constraint is on the amount of effort to be used Suppose that a search of the above type is conducted in such a manner as to produce the maximum increase in probability of detection for each increment of effort added to the search. Then under very weak assumptions, it is proven that this search will produce an optimal allocation of the total effort involved. Under some additional assumptions, it is shown that any amount of search effort may be allocated in an optimal fashion. 相似文献
162.
The nonlinear difference equation for the distribution of the busy period for an unbounded discrete time queue of M|G| 1 type is solved numerically by a monotone iterative procedure. A starting solution is found by computing a first passage time distribution in a truncated version of the queue. 相似文献
163.
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. 相似文献
164.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
165.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail. 相似文献
166.
Patrick G. McKeown 《海军后勤学研究》1976,23(3):455-460
To rank the solutions to the assignment problem using an extreme point method, it is necessary to be able to find all extreme points which are adjacent to a given extreme solution. Recent work has shown a procedure for determining adjacent vertices on transportation polytopes using a modification of the Chernikova Algorithm. We present here a procedure for assignment polytopes which is a simplification of the more general procedure for transportation polytopes and which also allows for implicit enumeration of adjacent vertices. 相似文献
167.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献
168.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed. 相似文献
169.
170.
Michael D. Yaffe 《Defense & Security Analysis》1989,5(2):163-166
Strategy, Politics and Defense Budgets. By Warner R. Schilling, Paul Y. Hammond and Glenn H. Snyder. Columbia University Press, New York (1962) 相似文献