全文获取类型
收费全文 | 493篇 |
免费 | 14篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 12篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 115篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2006年 | 7篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1998年 | 7篇 |
1997年 | 5篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 10篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 14篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 9篇 |
1974年 | 4篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有507条查询结果,搜索用时 0 毫秒
221.
Finite Markov processes are considered, with bidimensional state space, such that transitions from state (n, i) to state (m, j) are possible only if m ≤ n + 1. The analysis leads to efficient computational algorithms, to determine the stationary probability distribution, and moments of first passage times. 相似文献
222.
223.
D. Pickup Spyros Economides G. Harries-Jenkins James J. Wirtz G. Barral 《Defense & Security Analysis》1992,8(3):329-335
British Naval Policy and Norwegian Security: Maritime Power in Transition, 1951-60.. By Mats Berdal. Forsvarsstudier No. 2/92, Institutt For Forsvarsstudier (IFS) Oslo, Norway, 1992, ISSN 0333-3981.
The European Security Order Recast: Scenarios for the Post-Cold War Era.. By Barry Buzan, Morten Kelstrup, Pierre Lemaitre, Elzbieta Tromer and OLE Waever. Pinter, London (1990), ISBN 086187143X, £30.00.
Mates and Muchachos: Unit Cohesion in the Falklands War.. By Nora Kinzer Stewart. Brassey's (US), Washington DC (1991), ISBN 008-037-4395, $20.
The Declining Hegemon: The United States and European Defense, 1960-1990.. By Joseph Lepgold. Praeger, New York (1990), ISBN 0-275-93657-0, $15.95 pb.
Inventing Accuracy: A Historical Sociology of Nuclear Missile Guidance.. By Donald Mackenzie. MIT Press, Cambridge MA, and London, England (1990), ISBN 262-132-583, £19.95. 相似文献
The European Security Order Recast: Scenarios for the Post-Cold War Era.. By Barry Buzan, Morten Kelstrup, Pierre Lemaitre, Elzbieta Tromer and OLE Waever. Pinter, London (1990), ISBN 086187143X, £30.00.
Mates and Muchachos: Unit Cohesion in the Falklands War.. By Nora Kinzer Stewart. Brassey's (US), Washington DC (1991), ISBN 008-037-4395, $20.
The Declining Hegemon: The United States and European Defense, 1960-1990.. By Joseph Lepgold. Praeger, New York (1990), ISBN 0-275-93657-0, $15.95 pb.
Inventing Accuracy: A Historical Sociology of Nuclear Missile Guidance.. By Donald Mackenzie. MIT Press, Cambridge MA, and London, England (1990), ISBN 262-132-583, £19.95. 相似文献
224.
This paper is a case study. We show how the powerful methods of time series analysis can be used to investigate the interrelationships between Alert Availability, a logistics performance variable, and Flying Hours, an operational requirement, in the presence of a major change in operating procedures and using contaminated data. The system considered is the fleet of C-141 aircraft of the U.S. Air Force. The major change in operating procedures was brought about by what is known as Reliability Centered Maintenance, and the contaminated data were due to anomalies in reporting procedures. The technique used is a combination of transfer function modeling and intervention analysis. 相似文献
225.
K. D. Glazebrook 《海军后勤学研究》1981,28(2):289-300
It is shown that there is an optimal strategy for a class of stochastic scheduling problems which is nonpreemptive. The results which yield this conclusion are generalizations of previous ones due to Glazebrook and Gittins. These new results also lead to an evaluation of the performance of nonpreemptive strategies in a large class of problems of practical interest. 相似文献
226.
227.
We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times ai, ai, ? 0, require di time units for processing and must be completed by times bi for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi-stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed. 相似文献
228.
Recent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/Fmax) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness. 相似文献
229.
Lawrence D. Stone 《海军后勤学研究》1972,19(1):111-122
This paper concerns the approximation of optimal allocations by δ allocations. δ allocations are obtained by fixing an increment δ of effort and deciding at each step upon a single cell in which to allocate the entire increment. It is shown that δ allocations may be used as a simple method of approximating optimal allocations of effort resulting from constrained separable optimization problems involving a finite number of cells. The results are applied to find δ allocations (called δ plans) which approximate optimal search plans. δ plans have the property that as δ → 0, the mean time to find the target using a δ plan approaches the mean time when using the optimal plan. δ plans have the advantage that. they are easily computed and more easily realized in practice than optimal plans which tend to be difficult to calculate and to call for spreading impractically small amounts of effort over large areas. 相似文献
230.
In this paper, the mathematical model for the allocation of resources among a general mix of percentage vulnerable and of numerically vulnerable weapon systems is presented and solved. Percentage vulnerable systems consist of mobile weapons which are difficult to locate, but relatively easy to destroy once located; numerically vulnerable systems comprise easily located fixed base weapons which are difficult to destroy. The distinguishing feature of this analysis is the inclusion of development costs. The theory of max-min is extended as necessary to solve this problem. References are provided to a sequence of earlier versions of this problem. 相似文献