全文获取类型
收费全文 | 275篇 |
免费 | 10篇 |
出版年
2021年 | 4篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2014年 | 8篇 |
2013年 | 52篇 |
2011年 | 2篇 |
2010年 | 4篇 |
2009年 | 6篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 12篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 2篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1967年 | 2篇 |
排序方式: 共有285条查询结果,搜索用时 15 毫秒
121.
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. 相似文献
122.
123.
124.
This paper considers the problem of modeling the reliability of a repairable system or device that is experiencing reliability improvement. Such a situation arises when system failure modes are gradually being corrected by a test-fix-test-fix procedure, which may include design changes. A dynamic reliability model for this process is discussed and statistical techniques are derived for estimating the model parameters and for testing the goodness-of-fit to observed data. The reliability model analyzed was first proposed as a graphical technique known as Duane plots, but can also be viewed as a nonhomogeneous Poisson process with a particular mean value function. 相似文献
125.
William P. Pierskalla 《海军后勤学研究》1969,16(2):217-228
A stochastic single product convex cost inventory problem is considered in which there is a probability, πj, that the product will become obsolete in the future period j. In an interesting paper, Barankin and Denny essentially formulate the model, but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications, but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into the model before computing the optimal policies. 相似文献
126.
Harold P. Benson 《海军后勤学研究》1985,32(1):165-177
We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code. 相似文献
127.
128.
129.
130.
John P. Cann 《Small Wars & Insurgencies》2013,24(1):103-128
The lessons from the two French counterinsurgencies, Indochina and Algeria, give rise to a new understanding of the projection of airpower in remote and hostile environments and the purpose, design, and use of aircraft in counterinsurgency. In both Indochina and Algeria, the campaigns were ones of poverty, and it is their imaginative management under severe resource constraints that provides thoughtful and applicable lessons for today. In both cases, airpower held the promise of delivering victory and solving the resource issue. In Indochina, acquisition of the needed aircraft, operating knowledge, and experience came too slowly to realize this promise. In Algeria, the French embraced the lessons from Indochina and were quite successful and innovative in the use of airpower. The lessons can be reduced to four requirements: (1) a network of airfields for liaison, ground-support, and intra-theater airlift to enable effective air support of ground forces; (2) a solid, reliable, and simple ground-support aircraft capable of operating from forward airfields within range of ground engagements; (3) a capable intra-theater heavy-lift transport to supply the extended ground forces; and (4) helicopter capability to enhance tactical troop mobility and support. 相似文献