全文获取类型
| 收费全文 | 577篇 |
| 免费 | 0篇 |
专业分类
| 577篇 |
出版年
| 2019年 | 12篇 |
| 2017年 | 17篇 |
| 2016年 | 10篇 |
| 2015年 | 14篇 |
| 2014年 | 15篇 |
| 2013年 | 109篇 |
| 2012年 | 5篇 |
| 2011年 | 5篇 |
| 2010年 | 8篇 |
| 2009年 | 11篇 |
| 2007年 | 6篇 |
| 2006年 | 8篇 |
| 2005年 | 9篇 |
| 2004年 | 11篇 |
| 2003年 | 5篇 |
| 2002年 | 10篇 |
| 2001年 | 4篇 |
| 2000年 | 7篇 |
| 1999年 | 6篇 |
| 1998年 | 12篇 |
| 1997年 | 6篇 |
| 1996年 | 8篇 |
| 1995年 | 4篇 |
| 1994年 | 15篇 |
| 1993年 | 14篇 |
| 1992年 | 8篇 |
| 1991年 | 14篇 |
| 1990年 | 8篇 |
| 1989年 | 14篇 |
| 1988年 | 14篇 |
| 1987年 | 15篇 |
| 1986年 | 16篇 |
| 1985年 | 12篇 |
| 1984年 | 8篇 |
| 1983年 | 7篇 |
| 1982年 | 7篇 |
| 1981年 | 8篇 |
| 1980年 | 5篇 |
| 1979年 | 8篇 |
| 1978年 | 12篇 |
| 1976年 | 7篇 |
| 1975年 | 6篇 |
| 1974年 | 8篇 |
| 1973年 | 7篇 |
| 1972年 | 9篇 |
| 1971年 | 4篇 |
| 1970年 | 9篇 |
| 1969年 | 6篇 |
| 1968年 | 4篇 |
| 1967年 | 6篇 |
排序方式： 共有577条查询结果，搜索用时 0 毫秒
321.
This paper considers the search for an evader concealed in one of two regions, each of which is characterized by its detection probability. The single-sided problem, in which the searcher is told the probability of the evader being located in a particular region, has been examined previously. We shall be concerned with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move: his optimal strategy consists of that probability distribution which maximizes the expected time to detection, while the searcher's optimal strategy is the sequence of searches which limits the evader to this expected time. It transpires for this problem that optimal strategies for both searcher and evader may generally be obtained to a surprisingly good degree of approximation by using the optimal strategies for the closely related (but far more easily solved) problem in which the evader is completely free to move between searches. 相似文献
322.
George R. Fitzpatrick Jerome Bracken Mary J. O'brien Lee G. Wentling Justin C. Whiton 《海军后勤学研究》1967,14(2):241-255
A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used. 相似文献
323.
Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
324.
One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
325.
326.
327.
328.
329.
330.
This article investigates the problem of planning an optimal layered search for a stationary target. A search is layered if it assigns each point in the search space an integer number of glimpses or looks. General necessary and sufficient conditions and an existence theorem are obtained. The special case in which the initial target distribution is bivariate normal is considered in detail. 相似文献