全文获取类型
收费全文 | 651篇 |
免费 | 17篇 |
出版年
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 7篇 |
2013年 | 119篇 |
2011年 | 7篇 |
2009年 | 10篇 |
2007年 | 8篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 14篇 |
1995年 | 13篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 23篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 11篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 8篇 |
1972年 | 16篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 8篇 |
1967年 | 10篇 |
1966年 | 5篇 |
排序方式: 共有668条查询结果,搜索用时 15 毫秒
151.
152.
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. 相似文献
153.
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. 相似文献
154.
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. 相似文献
155.
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. 相似文献
156.
Salah E. Elmaghraby 《海军后勤学研究》1968,15(1):23-32
Given n jobs and a single facility, and the fact that a subset of jobs are “related” to each other in such a manner that regardless of which job is completed first, its utility is hampered until all other jobs in the same subset are also completed, it is desired to determine the sequence which minimizes the cost of tardiness. The special case of pairwise relationship among all jobs is easily solved. An algorithm for the general case is given through a dynamic programming formulation. 相似文献
157.
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. 相似文献
158.
159.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献
160.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献