全文获取类型
收费全文 | 532篇 |
免费 | 8篇 |
出版年
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 15篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 102篇 |
2010年 | 6篇 |
2008年 | 10篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 7篇 |
1989年 | 11篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 14篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 14篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 9篇 |
1974年 | 9篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 14篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有540条查询结果,搜索用时 15 毫秒
221.
Much work has been done in search theory; however, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these Probabilities remain fixed for all searching and locations. The class of sequential search policies which terminate the search at the first acceptance is assumed. A single two-part optimization criterion is considered. The search sequence is found which (i) minimizes the probability of obtaining n rejections in the first n steps for all n, and (ii) maximizes the probability that the first acceptance occurs within the first n steps and occurs at the object's location for all n. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location. 相似文献
222.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献
223.
224.
This article presents the results of comparing the performance of several cannibalization policies using a simulation model of a maintenance system with spares, repair, and resource constraints. Although the presence of cannibalization has been incorporated into a number of maintenance system models reported in the literature, the questions of whether cannibalization should be done and what factors affect canibalization have received little attention. Policies tested include both no cannibalization and unlimited cannibalization as well as other based on the number of maintenance personnel available, the short-term machine failure rate at the time of cannibalization, and the relationship between the mean cannibalization and repair rates. The best policies found are those that allow cannibalization only when it can be done quickly relative to repair or when it can be done without delaying part repair actions. The policy of complete cannibalization (always cannibalize when it is possible) is found to perform poorly except when either average maintenance personnel utilization is very low or when mean cannibalization times are very short relative to mean repair times. The latter result casts doubts on the appropriateness of the assumption of complete cannibalization in many models in the literature. 相似文献
225.
226.
227.
228.
Michael D. Krause 《Defense & Security Analysis》1988,4(3):321-326
The Brain of an Army: a Popular Account of the German General Staff. By Spenser Wilkinson. Archibald Constable, London (1st edition 1890, 2nd edition 1895) 相似文献
229.
This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented. 相似文献
230.
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. 相似文献