全文获取类型
收费全文 | 368篇 |
免费 | 44篇 |
出版年
2021年 | 9篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 12篇 |
2013年 | 83篇 |
2012年 | 10篇 |
2011年 | 8篇 |
2010年 | 6篇 |
2009年 | 14篇 |
2008年 | 9篇 |
2007年 | 15篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 12篇 |
2003年 | 12篇 |
2002年 | 16篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 9篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
排序方式: 共有412条查询结果,搜索用时 15 毫秒
301.
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. 相似文献
302.
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. 相似文献
303.
James K. Hartman 《海军后勤学研究》1973,20(3):569-576
When applied to a problem which has more than one local optimal solution, most nonlinear programming algorithms will terminate with the first local solution found. Several methods have been suggested for extending the search to find the global optimum of such a nonlinear program. In this report we present the results of some numerical experiments designed to compare the performance of various strategies for finding the global solution. 相似文献
304.
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. 相似文献
305.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
306.
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. 相似文献
307.
K.-H. Waldmann 《海军后勤学研究》1983,30(3):377-386
A system is subject to a sequence of randomly occurring shocks. Each shock causes a random amount of damage which accumulates additively. Any of the shocks might cause the system to fail. The shock process is in some sense related to an environmental process in order to describe randomly varying external factors of an economical and/or technical nature as well as internal factors of a statistical nature. A discrete time formulation of the problem is given. Sufficient conditions are found for optimality of a generalized control-limit rule with respect to the total cost criterion: Whenever the accumulated damage s is not less than a specified critical number t(i), depending on the environmental state i, replace the system by a new one; otherwise do not replace it. Moreover, bounds are given for these critical numbers. 相似文献
308.
Ranking is a common task for selecting and evaluating alternatives. In the past few decades, combining rankings results from various sources into a consensus ranking has become an increasingly active research topic. In this study, we focus on the evaluation of rank aggregation methods. We first develop an experimental data generation method, which can provide ground truth ranking for alternatives based on their “inherent ability.” This experimental data generation method can generate the required individual synthetic rankings with adjustable accuracy and length. We propose characterizing the effectiveness of rank aggregation methods by calculating the Kendall tau distance between the aggregated ranking and the ground truth ranking. We then compare four classical rank aggregation methods and present some useful findings on the relative performances of the four methods. The results reveal that both the accuracy and length of individual rankings have a remarkable effect on the comparison results between rank aggregation methods. Our methods and results may be helpful to both researchers and decision‐makers. 相似文献
309.
Items are characterized by a set of attributes (T) and a collection of covariates (X) associated with those attributes. We wish to screen for acceptable items (T ∈ CT), but T is expensive to measure. We envisage a two-stage screen in which observation of X_ is used as a filter at the first stage to sentence most items. The second stage involves the observation of T for those items for which the first stage is indecisive. We adopt a Bayes decision-theoretic approach to the development of optimal two-stage screens within a general framework for costs and stochastic structure. We also consider the important question of how much screens need to be modified in the light of resource limitations that bound the proportion of items that can be passed to the second stage. © 1996 John Wiley & Sons, Inc. 相似文献
310.
This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001 相似文献