全文获取类型
收费全文 | 957篇 |
免费 | 16篇 |
出版年
2019年 | 18篇 |
2018年 | 10篇 |
2017年 | 27篇 |
2016年 | 17篇 |
2015年 | 18篇 |
2014年 | 19篇 |
2013年 | 209篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 11篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 7篇 |
2000年 | 11篇 |
1999年 | 11篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 14篇 |
1995年 | 14篇 |
1994年 | 22篇 |
1993年 | 20篇 |
1992年 | 15篇 |
1991年 | 24篇 |
1990年 | 14篇 |
1989年 | 19篇 |
1988年 | 23篇 |
1987年 | 25篇 |
1986年 | 25篇 |
1985年 | 21篇 |
1984年 | 10篇 |
1983年 | 13篇 |
1982年 | 17篇 |
1981年 | 12篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 14篇 |
1972年 | 14篇 |
1971年 | 11篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1968年 | 10篇 |
1967年 | 10篇 |
排序方式: 共有973条查询结果,搜索用时 15 毫秒
201.
202.
203.
204.
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. 相似文献
205.
This paper describes the background of the Office of Management Budget Circular A-21, “Principles for Determining Costs Applicable to Grants, Contracts, and Other Agreements with Educational Institutions,” that describes the requirement for effort reporting. A sampling procedure is proposed as an alternative to 100% reporting. 相似文献
206.
Philip J. Boland 《海军后勤学研究》1982,29(4):541-546
A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at multiples of some period T while minimal repair is performed at any intervening system failures. The cost of a minimal repair to the system is assumed to be a nonde-creasing function of its age. A simple expression is derived for the expected minimal repair cost in an interval in terms of the cost function and the failure rate of the system. Necessary and sufficient conditions for the existence of an optimal replacement interval are exhibited in the case where the system life distribution is strictly increasing failure rate (IFR). 相似文献
207.
A general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example. 相似文献
208.
The problem of computing reliability and availability and their associated confidence limits for multi-component systems has appeared often in the literature. This problem arises where some or all of the component reliabilities and availabilities are statistical estimates (random variables) from test and other data. The problem of computing confidence limits has generally been considered difficult and treated only on a case-by-case basis. This paper deals with Bayes confidence limits on reliability and availability for a more general class of systems than previously considered including, as special cases, series-parallel and standby systems applications. The posterior distributions obtained are exact in theory and their numerical evaluation is limited only by computing resources, data representation and round-off in calculations. This paper collects and generalizes previous results of the authors and others. The methods presented in this paper apply both to reliability and availability analysis. The conceptual development requires only that system reliability or availability be probabilities defined in terms acceptable for a particular application. The emphasis is on Bayes Analysis and the determination of the posterior distribution functions. Having these, the calculation of point estimates and confidence limits is routine. This paper includes several examples of estimating system reliability and confidence limits based on observed component test data. Also included is an example of the numerical procedure for computing Bayes confidence limits for the reliability of a system consisting of N failure independent components connected in series. Both an exact and a new approximate numerical procedure for computing point and interval estimates of reliability are presented. A comparison is made of the results obtained from the two procedures. It is shown that the approximation is entirely sufficient for most reliability engineering analysis. 相似文献
209.
Mary W. Cooper 《海军后勤学研究》1980,27(1):89-95
This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply-constrained problem. 相似文献
210.
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. 相似文献