全文获取类型
收费全文 | 291篇 |
免费 | 10篇 |
出版年
2021年 | 11篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 39篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 10篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 7篇 |
2003年 | 2篇 |
2002年 | 9篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 4篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 2篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1968年 | 2篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
191.
192.
193.
194.
Charles H. Reilly Clark A. Mount-Campbell Fernando Mata Eric K. Walton Eric A. Aebker Curt A. Levis 《海军后勤学研究》1991,38(6):779-797
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized. 相似文献
195.
K. H. Wickwire 《海军后勤学研究》1981,28(3):423-429
We investigate a class of optimal stopping problems for dynamical systems described by one-dimensional differential equations with an additive Poisson disturbance. The rate of the disturbance may depend upon the current state of the system. A dynamic programming equation for the optimal stopping cost is derived along with conditions which must be met at the boundary of the optimal stopping set. These boundary conditions depend upon whether or not the stopping set may be entered by smooth motion. 相似文献
196.
In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method. 相似文献
197.
The shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case. This paper presents a parametric approach for solving this problem. The algorithm presented would require, on the average, a number of iterations which is polynomially bounded. The similarity of this approach to that of the generalized Lagrange multiplier technique is demonstrated and a numerical example is presented. 相似文献
198.
A computationally feasible matrix method is presented to find the first-passage probabilities in a Markov chain where a set of states is taboo during transit. This concept has been used to evaluate the reliability of a system whose changes in strength can be thought of as a Markov chain, while the environment in which it is functioning generates stresses which can also be envisaged as another Markov chain. 相似文献
199.
K. Truemper 《海军后勤学研究》1976,23(3):555-565
Steady-state probabilities for a multipopulation single channel multiserver queuing system with first-come first-served queue discipline are established. Special cases lead to simplified formulas which sometimes can be evaluated using existing statistical and/or queuing tables. Optimization aspects are considered involving control of service rates. Several applications are presented. 相似文献
200.
Recurrence relations for the product moments of order statistics from a doubly truncated exponential distribution are obtained. These relations allow us to evaluate the product moments for all sample sizes. 相似文献