全文获取类型
收费全文 | 3464篇 |
免费 | 84篇 |
国内免费 | 1篇 |
专业分类
3549篇 |
出版年
2021年 | 37篇 |
2019年 | 89篇 |
2018年 | 51篇 |
2017年 | 80篇 |
2016年 | 78篇 |
2015年 | 67篇 |
2014年 | 72篇 |
2013年 | 713篇 |
2012年 | 46篇 |
2011年 | 48篇 |
2010年 | 55篇 |
2009年 | 47篇 |
2008年 | 68篇 |
2007年 | 59篇 |
2006年 | 45篇 |
2005年 | 44篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 47篇 |
1997年 | 49篇 |
1996年 | 61篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 63篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 70篇 |
1985年 | 64篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
排序方式: 共有3549条查询结果,搜索用时 0 毫秒
151.
152.
153.
154.
155.
Marvin D. Troutt 《海军后勤学研究》1987,34(4):593-603
Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method. 相似文献
156.
The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method. 相似文献
157.
A. W. Kemp 《海军后勤学研究》1987,34(6):853-858
The article examines ways of computing cumulative probabilities for a constrained Poissonian binomial distribution arising from a model of a weapon defense system. 相似文献
158.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach. 相似文献
159.
The general problem we are concerned with here is the estimation of Pθ(C) where C is some fixed event and Pθ is unknown in some class. The various available estimation procedures seem to involve the choice of some random probability measure. In particular we consider this problem when C is a disk in R2 centered at o and Pθ is restricted to be bivariate normal. Details concerning the implementation of the estimation procedures and a Monte Carlo study are discussed for this case. This particular problem arises when we are concerned with assessing the accuracy of a targeting procedure. 相似文献
160.
Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered. 相似文献