全文获取类型
| 收费全文 | 653篇 |
| 免费 | 1篇 |
专业分类
| 654篇 |
出版年
| 2021年 | 12篇 |
| 2019年 | 25篇 |
| 2018年 | 18篇 |
| 2017年 | 13篇 |
| 2016年 | 13篇 |
| 2015年 | 15篇 |
| 2014年 | 14篇 |
| 2013年 | 122篇 |
| 2009年 | 9篇 |
| 2007年 | 7篇 |
| 2006年 | 5篇 |
| 2005年 | 10篇 |
| 2004年 | 10篇 |
| 2003年 | 10篇 |
| 2002年 | 8篇 |
| 2001年 | 6篇 |
| 2000年 | 10篇 |
| 1999年 | 5篇 |
| 1998年 | 8篇 |
| 1997年 | 19篇 |
| 1996年 | 9篇 |
| 1995年 | 5篇 |
| 1994年 | 12篇 |
| 1993年 | 6篇 |
| 1992年 | 6篇 |
| 1991年 | 16篇 |
| 1990年 | 8篇 |
| 1989年 | 11篇 |
| 1988年 | 14篇 |
| 1987年 | 16篇 |
| 1986年 | 13篇 |
| 1985年 | 7篇 |
| 1984年 | 6篇 |
| 1983年 | 11篇 |
| 1982年 | 8篇 |
| 1981年 | 6篇 |
| 1980年 | 10篇 |
| 1979年 | 14篇 |
| 1978年 | 7篇 |
| 1977年 | 9篇 |
| 1976年 | 10篇 |
| 1975年 | 9篇 |
| 1974年 | 12篇 |
| 1973年 | 14篇 |
| 1972年 | 9篇 |
| 1971年 | 10篇 |
| 1970年 | 10篇 |
| 1969年 | 9篇 |
| 1968年 | 7篇 |
| 1967年 | 5篇 |
排序方式： 共有654条查询结果，搜索用时 15 毫秒
141.
AirSea Battle (ASB) has generated significant publicity, controversy, and debate among scholars, analysts, commentators, and observers of US defense strategy. However, a research gap exists concerning formal analysis of the impact of the operational concept on the relationship between the US Air Force (USAF) and the US Navy (USN). The impact of the ASB operational concept on the USAF–USN relationship is examined across the issue areas of strategy, budgets, weapons procurement, and training. These four issue areas represent important areas of historical conflict and competition between the Air Force and Navy. The conclusion is that ASB is ushering in a new era of Air Force–Navy partnership that advances the inter-service dynamic from “jointness” toward integration. The emergent USAF–USN partnership therefore represents a significant development in US defense politics and defense strategy. 相似文献
142.
The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017 相似文献
143.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
144.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
145.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
146.
147.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
148.
Mathilde von Bülow Lecturer 《战略研究杂志》2013,36(4):703-729
Between 1957 and 1959 the West German company Telefunken and the Bonn government became prime targets in the French army's campaign against the Front de Libération Nationale's (FLN) efforts to establish communications networks. To the French military, the prevention of sales of Telefunken equipment to the FLN or its allies constituted a matter of strategic importance. To the Germans, it was an act of economic protectionism that exposed France's continued misgivings of Germany. The problem exerted a considerable strain between Paris and Bonn, and even threatened to harm German-Arab relations. The Telefunken affair thus highlights the Algerian war's international ramifications. It further reveals the responsibility of the French military in the internationalisation of that war. 相似文献
149.
Strengthening the United States' ability to prevent adversaries from smuggling nuclear materials into the country is a vital and ongoing issue. The prospect of additional countries, such as Iran, obtaining the know‐how and equipment to produce these special nuclear materials in the near future underscores the need for efficient and effective inspection policies at ports and border crossings. In addition, the reduction of defense and homeland security budgets in recent years has made it increasingly important to accomplish the interdiction mission with fewer funds. Addressing these complications, in this article, we present a novel two‐port interdiction model. We propose using prior inspection data as a low‐cost way of increasing overall interdiction performance. We provide insights into two primary questions: first, how should a decision maker at a domestic port use detection data from the foreign port to improve the overall detection capability? Second, what are potential limitations to the usefulness of prior inspection data—is it possible that using prior data actually harms decision making at the domestic port? We find that a boundary curve policy (BCP) that takes into account both foreign and domestic inspection data can provide a significant improvement in detection probability. This BCP also proves to be surprisingly robust, even if adversaries are able to infiltrate shipments during transit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 433‐448, 2013 相似文献
150.
In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013 相似文献