全文获取类型
收费全文 | 3427篇 |
免费 | 84篇 |
国内免费 | 1篇 |
专业分类
3512篇 |
出版年
2021年 | 38篇 |
2019年 | 89篇 |
2018年 | 55篇 |
2017年 | 86篇 |
2016年 | 82篇 |
2015年 | 63篇 |
2014年 | 67篇 |
2013年 | 740篇 |
2010年 | 36篇 |
2009年 | 40篇 |
2008年 | 50篇 |
2007年 | 52篇 |
2006年 | 38篇 |
2005年 | 46篇 |
2004年 | 57篇 |
2003年 | 43篇 |
2002年 | 57篇 |
1999年 | 42篇 |
1998年 | 47篇 |
1997年 | 48篇 |
1996年 | 63篇 |
1995年 | 44篇 |
1994年 | 59篇 |
1993年 | 65篇 |
1992年 | 60篇 |
1991年 | 75篇 |
1990年 | 41篇 |
1989年 | 72篇 |
1988年 | 79篇 |
1987年 | 71篇 |
1986年 | 73篇 |
1985年 | 64篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 47篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 47篇 |
1974年 | 52篇 |
1973年 | 51篇 |
1972年 | 52篇 |
1971年 | 44篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 35篇 |
排序方式: 共有3512条查询结果,搜索用时 0 毫秒
681.
Richard N. Burns 《海军后勤学研究》1976,23(1):125-129
A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems. 相似文献
682.
This paper develops bounds on the uncertainties in system availabilities or reliabilities which have been computed from structural (series, parallel, etc.) relations among uncertain subsystem availabilities or reliabilities. It is assumed that the highly available (reliable) subsystems have been tested or simulated to determine their unavailabilities (unreliabilities) to within some small percentages of uncertainty. It is shown that series, parallel and r out of n structures which are nominally highly available will have unavailability uncertainties whose percentages errors are of the same order as the subsystem uncertainties. Thus overall system analysis errors, even for large systems, are of the same order of magnitude as the uncertainties in the component probabilities. Both systematic (bias type) uncertainties and independent random uncertainties are considered. 相似文献
683.
684.
An implicit enumeration algorithm is developed to determine the set of efficient points in zero-one multiple criteria problems. The algorithm is specialized for the solution of a particular class of facility location problems. The procedure is complemented with the use of the utility function of the decision maker to identify a subset of efficient point candidates for the final selection. Computational results are provided and discussed. 相似文献
685.
The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph. 相似文献
686.
Jerrold H. May 《海军后勤学研究》1982,29(3):429-442
Must Newton-type methods for linearly constrained optimization be either of the modified Newton or quasi-Newton variety? The contention of this paper is that explicity recomputing part of the projected Hessian may be superior to both approaches. A computational comparison with MINOS is presented. 相似文献
687.
Averill M. Law 《海军后勤学研究》1980,27(1):131-143
In this paper we precisely define the two types of simulations (terminating and steady-state) with regard to analysis of simulation output and discuss some common measures of performance for each type. In addition, we conclude, on the basis of discussions with many simulation practitioners, that both types of simulations are important in practice. This is contrary to the impression one gets from reading the simulation literature, where the steady-state case is almost exclusively considered. Although analyses of terminating simulations are considerably easier than are those of steady-state simulations, they have not received a careful treatment in the literature. We discuss and give empirical results for fixed sample size, relative width, and absolute width procedures that can be used for constructing confidence intervals for measures of performance in the terminating case. 相似文献
688.
John J. Jarvis 《海军后勤学研究》1969,16(4):525-529
The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence. 相似文献
689.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =
690.