全文获取类型
收费全文 | 143篇 |
免费 | 2篇 |
出版年
2020年 | 1篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 61篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2004年 | 1篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有145条查询结果,搜索用时 218 毫秒
81.
n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity Fi, a processing time Ei, a deadline Di, relative to each request of task i, a task-request interrupt overhead Ii, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered. 相似文献
82.
The problem is to protect a set of T identical targets that may come under attack by A identical weapons. The targets are to be defended by D identical interceptors, which must be preallocated to defend selected targets. The attacker is aware of the number of interceptors, but is ignorant of their allocation. The size of the attack is chosen by the attacker from within a specified range. The robust strategies developed in this article do not require the defender to assume an attack size. Rather, the defender chooses a strategy which is good over a wide range of attack sizes, though not necessarily best for any particular attack size. The attacker, knowing that the defender is adopting a robust strategy, chooses the optimal attack strategy for the number of weapons he chooses to expend. The expected number of survivors is a function of the robust defense strategy and optimal attack strategy against this robust defense. 相似文献
83.
Peter R. Neumann 《Low Intensity Conflict & Law Enforcement》2002,11(1):116-138
This article examines why paramilitary campaigns in Northern Ireland have continued despite the current peace process. In advancing three instrumental explanations of paramilitary violence, the author provides a useful analytical framework which shows that while organizational interpretations are dominating the public discourse, republicans and loyalists continue to use paramilitary violence as a strategic means of threat and coercion. Furthermore, even though policy implications are not discussed in detail, it will be demonstrated that the dominance of organizational imperatives has resulted in excessive leniency by the state, which - in turn - has contributed to the fragility of the peace process. 相似文献
84.
This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
85.
In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016 相似文献
86.
87.
88.
In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
89.
Cyberspace has emerged as a potentially new (and unconventional) domain for warfare. Much debate has focused on understanding cyber conflict. The ability to critically analyse this phenomenon is important; however, the nascent nature of cyberwarfare and the complexity of the systems involved create challenges not met by conventional approaches. As a first step, this requires an analytical construct to frame discussions in a way that highlights distinct characteristics of the cyber domain. An approach proposed is one of the postulating conjectures for debate as a way to achieve this and to demonstrate its use, both at the strategic and operational levels. It is suggested that such an approach provides one component of a mature analytical framework for the analysis of cyber across a range of warfare domains. 相似文献
90.
Capability-based planning (CBP) is considered by many defence organisations to be the best practice for enterprise-level planning, analysis and management. This approach, loosely based around investment portfolio theory, is premised on balancing the cost, benefit and risk of capability options across the defence enterprise. However a number of authors have recently noted limitations of its current applications. The authors propose a more general, insurance-based approach, which can support the evolutionary improvement of the current CBP approach. This approach is implemented as hedging-based planning and aims to better reflect the enterprise nature of defence organisations, capturing both force structure and force generation aspects of military systems. 相似文献