全文获取类型
收费全文 | 171篇 |
免费 | 4篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 6篇 |
2018年 | 12篇 |
2017年 | 4篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 58篇 |
2011年 | 1篇 |
2009年 | 1篇 |
2008年 | 2篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有175条查询结果,搜索用时 265 毫秒
1.
2.
3.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction. 相似文献
4.
5.
Ancker's stochastic duels with limited ammunition supply are extended to cases where a kill is obtained through repetitive multiple hits with two firing modes, single-shot firing and pattern firing. Examples with negative exponential firing time and geometric ammunition supply are given. 相似文献
6.
7.
8.
We present a new approach for inference from accelerated life tests. Our approach is based on a dynamic general linear model setup which arises naturally from the accelerated life-testing problem and uses linear Bayesian methods for inference. The advantage of the procedure is that it does not require large numbers of items to be tested and that it can deal with both censored and uncensored data. We illustrate the use of our approach with some actual accelerated life-test data. © 1992 John Wiley & Sons, Inc. 相似文献
9.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
10.
A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells, that either maximizes the probability of detection or minimizes the mean number of time periods required for detection. The search problem is modelled as a partially observable Markov decision process and several approximate solutions procedures are proposed. © 1995 John Wiley & Sons, Inc. 相似文献