全文获取类型
收费全文 | 606篇 |
免费 | 18篇 |
专业分类
624篇 |
出版年
2020年 | 5篇 |
2019年 | 9篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 8篇 |
2013年 | 122篇 |
2011年 | 6篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 14篇 |
1987年 | 13篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 12篇 |
1974年 | 11篇 |
1973年 | 11篇 |
1972年 | 13篇 |
1971年 | 13篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1948年 | 5篇 |
排序方式: 共有624条查询结果,搜索用时 0 毫秒
411.
This paper studies the congestion problems of the computer core storage units. The principle of storage request interleaving is briefly discussed as means of increasing thruput. An analytic model is proposed to analyze the core storage system with a two-way interleaving feature. The model, an approximation to the physical system, is an extension of a queueing model with bulk service considered by Bailey in Ref. [1]. 相似文献
412.
413.
Dennis C. Gilliland 《海军后勤学研究》1968,15(4):507-516
Given a target T in Euclidean n-space Rn and a point bomb whose point of impact in Rn is governed by a probability distribution about the aim point a, what choice of a maximizes the probability of a hit va(T)? Of course, only in special cases is an exact solution of this problem obtainable. This paper treats targets T which are symmetric about the origin o and demonstrates conditions on the extent of T and the impact density f, a density with respect to Lebesgue measure, sufficient for va(T) to be monotone in the distance from a to o and maximized at a = o. The results are applied to various tactical situations. 相似文献
414.
The Tactical Warfare Simulation Program is a procedure by which the major interactions among opposing military units and terrain features can be treated in a tactical limited warfare situation. It is a critical-area, sequence-of-event model and is programmed in SIM-SCRIPT. In this program a military unit is described by such properties as strength, size, location, velocity, and attrition rates. Some of the events which can occur to a military unit are entering/leaving terrain features, becoming engaged/disengaged with opposing units, retreating, reaching an objective, and breaking. Following a discussion of the general features of the program, a study of a hypothetical war is presented. 相似文献
415.
Richard C. Grinold 《海军后勤学研究》1972,19(1):123-136
Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0. 相似文献
416.
William C. Guenther 《海军后勤学研究》1972,19(2):309-333
A review of univariate tolerance intervals is presented from an application-oriented point of view. Both β-content and β-expectation intervals are defined and considered. Standard problems are discussed for the distribution-free case and with various distributional assumptions (normal, gamma, Poisson) which occur most frequently in practice. The determination of sample size is emphasized. A number of examples are used to illustrate the types of problems which permit solutions with the excellent tables now available. 相似文献
417.
C. B. Millham 《海军后勤学研究》1972,19(4):709-714
This work is concerned primarily with presenting techniques for constructing bimatrix games with predetermined equilibrium points. Some partial results on Nash-solvability are also given. 相似文献
418.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
419.
The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented. 相似文献
420.
Recurrence relations for the product moments of order statistics from a doubly truncated exponential distribution are obtained. These relations allow us to evaluate the product moments for all sample sizes. 相似文献