全文获取类型
收费全文 | 177篇 |
免费 | 3篇 |
出版年
2021年 | 2篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 2篇 |
2013年 | 39篇 |
2012年 | 4篇 |
2010年 | 1篇 |
2009年 | 3篇 |
2008年 | 1篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 1篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 2篇 |
1973年 | 1篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有180条查询结果,搜索用时 31 毫秒
141.
142.
Derrick V. Frazier 《Defence Studies》2017,17(4):379-397
Multinational Military Exercises (MMEs) are often viewed by states as opportunities to increase interoperability, improve cooperation, and solve common security problems. We argue that in addition to this, MMEs work as tools to shape the shared beliefs of coalition partners surrounding threat. Specifically, MMEs allow multinational forces to identify best practices, consolidate beliefs, and codify behavior through doctrine, typically by means of some institutional process. We examine our argument on MMEs through an analysis of various multinational and coalition partner efforts to identify security threats and cooperate through the development of common doctrine at the strategic, operational, and tactical levels of warfare. Our analysis suggests that the use of MMEs for doctrine development does help to socialize states in terms of identifying common threats and subsequently sharing a process by which to address them. 相似文献
143.
144.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献
145.
A number of results pertaining to preservation of aging properties (IFR, IFRA etc.) under various shock models are available in the literature. Our aim in this paper is to examine in the same spirit, the preservation of unimodality under various shock models. For example, it is proved that in a non-homogeneous Poisson shock model if {pk}K≥0, the sequence of probabilities with which the device fails on the kth shock, is unimodal then under some suitable conditions on the mean value function Λ (t), the corresponding survival function is also unimodal. The other shock models under which the preservation of unimodality is considered in this paper are pure birth shock model and a more general shock model in which shocks occur according to a general counting process. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 952–957, 1999 相似文献
146.
The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998 相似文献
147.
This study examines critically the various assumptions, results, and concepts that exist to date in the literature and scientific community concerning the relationships among the Lanchester, stochastic Lanchester, and the general renewal models of combat. Many of the prevailing understandings are shown to be erroneous. 相似文献
148.
After 15 years of war in Afghanistan and Iraq, many now see ‘small-footprint’ security force assistance (SFA) – training, advising and equipping allied militaries – as an alternative to large US ground-force commitments. Yet, its actual military efficacy has been little studied. This paper seeks to fill this gap. We find important limitations on SFA’s military utility, stemming from agency problems arising from systematic interest misalignment between the US and its typical partners. SFA’s achievable upper bound is modest and attainable only if US policy is intrusive and conditional, which it rarely is. For SFA, small footprints will usually mean small payoffs. 相似文献
149.
V. Venkateswaran 《海军后勤学研究》1991,38(5):679-698
In recent years, much attention has focused on mathematical programming problems with equilibrium constraints. In this article we consider the case where the constraints are complementarity constraints. Problems of this type arise, for instance, in the design of traffic networks. We develop here a descent algorithm for this problem that will converge to a local optimum in a finite number of iterations. The method involves solving a sequence of subproblems that are linear programs. Computational tests comparing our algorithm with the branch-and-bound algorithm in [7] bear out the efficacy of our method. When solving large problems, there is a definite advantage to coupling both methods. A local optimum incumbent provided by our algorithm can significantly reduce the computational effort required by the branch-and-bound algorithm. 相似文献
150.