全文获取类型
收费全文 | 433篇 |
免费 | 18篇 |
国内免费 | 1篇 |
专业分类
452篇 |
出版年
2021年 | 5篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 102篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1976年 | 9篇 |
1975年 | 11篇 |
1974年 | 6篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 6篇 |
1966年 | 3篇 |
排序方式: 共有452条查询结果,搜索用时 0 毫秒
281.
Corine M. Laan Ana Isabel Barros Richard J. Boucherie Herman Monsuur Judith Timmer 《海军后勤学研究》2019,66(2):174-190
In this paper, we introduce partially observable agent‐intruder games (POAIGs). These games model dynamic search games on graphs between security forces (an agent) and an intruder given possible (border) entry points and high value assets that require protection. The agent faces situations with dynamically changing, partially observable information about the state of the intruder and vice versa. The agent may place sensors at selected locations, while the intruder may recruit partners to observe the agent's movement. We formulate the problem as a two‐person zero‐sum game, and develop efficient algorithms to compute each player's optimal strategy. The solution to the game will help the agent choose sensor locations and design patrol routes that can handle imperfect information. First, we prove the existence of ?‐optimal strategies for POAIGs with an infinite time horizon. Second, we introduce a Bayesian approximation algorithm to identify these ?‐optimal strategies using belief functions that incorporate the imperfect information that becomes available during the game. For the solutions of large POAIGs with a finite time horizon, we use a solution method common to extensive form games, namely, the sequence form representation. To illustrate the POAIGs, we present several examples and numerical results. 相似文献
282.
283.
Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
284.
285.
We consider two opponents that compete in developing asymmetric technologies where each party's technology is aimed at damaging (or neutralizing) the other's technology. The situation we consider is different than the classical problem of commercial R&D races in two ways: First, while in commercial R&D races the competitors compete over the control of market share, in our case the competition is about the effectiveness of technologies with respect to certain capabilities. Second, in contrast with the “winner‐takes‐all” assumption that characterizes much of the literature on this field in the commercial world, we assume that the party that wins the race gains a temporary advantage that expires when the other party develops a superior technology. We formulate a variety of models that apply to a one‐sided situation, where one of the two parties has to determine how much to invest in developing a technology to counter another technology employed by the other party. The decision problems are expressed as (convex) nonlinear optimization problems. We present an application that provides some operational insights regarding optimal resource allocation. We also consider a two‐sided situation and develop a Nash equilibrium solution that sets investment values, so that both parties have no incentive to change their investments. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 128–145, 2012 相似文献
286.
James G. Taylor 《海军后勤学研究》1980,27(1):109-121
This paper studies combat between two homogeneous forces modelled with variable-coefficient Lanchester-type equations of modern warfare with supporting fires not subject to attrition. It shows that this linear differential-equation model for combat with supporting fires may be transformed into one without the supporting fires so that all the previous results for variable-coefficient Lanchester-type equations of modern warfare (without supporting fires) may be invoked. Consequently, new important results for representing the solution (i.e. force levels as functions of time) in terms of canonical Lanchester functions and also for predicting force annihilation are developed for this model with supporting fires. Important insights into the dynamics of combat between two homogeneous forces with such supporting fires are discussed. 相似文献
287.
Anthony G. Pazzanita 《战略研究杂志》2013,36(1):148-152
Peter Trubowitz, Defining the National Interest: Conflict and Change in American Foreign Policy. Chicago and London: University of Chicago Press, 1998. Pp.xvi + 353, biblio., figs, maps, index. $55 (cloth); $18.95 (paper). ISBN 0–226–81302–9. 相似文献
288.
289.
An availability‐oriented approach has been developed to decide when to replace an aging system. For an existing system, it is optimal to operate another year if and only if the incremental cost per available year is less than the lifetime average cost per available year of a new aircraft. We illustrate our approach using United States Air Force KC‐135 tanker data. In demonstrating our approach, we find it will be optimal to replace the KC‐135 by the end of the decade. 相似文献
290.
Nicholas G. Hall Gilbert Laporte Esaignani Selvarajah Chelliah Sriskandarajah 《海军后勤学研究》2005,52(3):261-275
We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献