全文获取类型
收费全文 | 826篇 |
免费 | 22篇 |
出版年
2019年 | 17篇 |
2018年 | 8篇 |
2017年 | 23篇 |
2016年 | 16篇 |
2015年 | 20篇 |
2014年 | 16篇 |
2013年 | 166篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 16篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 12篇 |
2000年 | 10篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 8篇 |
1996年 | 14篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 25篇 |
1990年 | 9篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 21篇 |
1986年 | 23篇 |
1985年 | 24篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1975年 | 7篇 |
1974年 | 12篇 |
1973年 | 9篇 |
1972年 | 16篇 |
1971年 | 9篇 |
1970年 | 16篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 11篇 |
排序方式: 共有848条查询结果,搜索用时 125 毫秒
141.
George E. Monahan 《海军后勤学研究》1986,33(2):293-307
This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information. 相似文献
142.
J. E. Angus 《海军后勤学研究》1986,33(3):385-390
An alternating renewal process starts at time zero and visits states 1,2,…,r, 1,2, …,r 1,2, …,r, … in sucession. The time spent in state i during any cycle has cumulative distribution function Fi, and the sojourn times in each state are mutually independent, positive and nondegenerate random variables. In the fixed time interval [0,T], let Ui(T) denote the total amount of time spent in state i. In this note, a central limit theorem is proved for the random vector (Ui(T), 1 ≤ i ≤ r) (properly normed and centered) as T → ∞. 相似文献
143.
We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distingushable, and the state of the system is given by knowing exactly which components are operationl and which have failed. The individual component failure rates depend on the state of the entire system. We assume that the rate at which the system produces income decreases as the system deteriorates and the system replacement cost rises. Individual components cannot be replaced. We give a greedy-type algorithm that produces the replacement policy that maximizes the long-run net system income per unit time. 相似文献
144.
145.
146.
147.
148.
A large population of independent identical units having finite mean lifetime T is observed. From the history A(y) of cumulative arrivals and the history B(y) of cumulative removals in the interval 0 ≦ y ≦ τ one must predict at time τ the desired T . Two lifetime predictors X(τ) and Y(τ) and related simple predictors obtained from A(y) and B(y) are shown to converge to T with a rate of convergence dependent on the structure of the failure rate function of the units. This dependence is studied theoretically and numerically. 相似文献
149.
J. M. Wilson 《海军后勤学研究》1983,30(1):49-57
Approaches are considered for the reduction of coefficients in linear integer inequalities. It is shown that coefficients may be reduced easily in many practical examples. The (0-1) problem is also reconsidered and certain areas of exploration developed. 相似文献
150.
In this article, we describe a new algorithm for solving all-integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all-integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all-integer algorithm of Gomory, but we incorporate certain row- and column-selection criteria which partially avoid the problem of dual-degenerate iterations. We present the results of computational testing. 相似文献