全文获取类型
收费全文 | 911篇 |
免费 | 28篇 |
出版年
2020年 | 8篇 |
2019年 | 18篇 |
2017年 | 24篇 |
2016年 | 17篇 |
2015年 | 22篇 |
2014年 | 21篇 |
2013年 | 171篇 |
2011年 | 8篇 |
2010年 | 10篇 |
2009年 | 15篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 13篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 20篇 |
1997年 | 15篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 27篇 |
1993年 | 22篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 20篇 |
1987年 | 22篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 15篇 |
1976年 | 12篇 |
1975年 | 13篇 |
1974年 | 15篇 |
1973年 | 12篇 |
1972年 | 17篇 |
1971年 | 10篇 |
1970年 | 11篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 9篇 |
排序方式: 共有939条查询结果,搜索用时 15 毫秒
191.
192.
193.
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. 相似文献
194.
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. 相似文献
195.
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). 相似文献
196.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models. 相似文献
197.
This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory. 相似文献
198.
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. 相似文献
199.
Roger C. Vergin 《海军后勤学研究》1968,15(4):523-534
Most maintenance and replacement models for industrial equipment have been developed for independent single-component machines. Most equipment, however, consists of multiple components. Also, when the maintenance crew services several machines, the maintenance policy for each machine is not independent of the states of the other machines. In this paper, two dynamic programming replacement models are presented. The first is used to determine the optimal replacement policy for multi-component equipment. The second is used to determine the optimal replacement policy for a multi-machine system which uses one replacement crew to service several machines. In addition, an approach is suggested for developing an efficient replacement policy for a multi-component, multi-machine system. 相似文献
200.