全文获取类型
收费全文 | 448篇 |
免费 | 17篇 |
国内免费 | 1篇 |
出版年
2021年 | 7篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 91篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 8篇 |
2006年 | 7篇 |
2003年 | 4篇 |
2002年 | 8篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 10篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 12篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 8篇 |
1975年 | 11篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 6篇 |
1971年 | 9篇 |
1970年 | 7篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有466条查询结果,搜索用时 15 毫秒
201.
202.
Harry F. Martz 《海军后勤学研究》1975,22(4):651-665
Empirical Bayes single-sample acceptance sampling procedures are derived. These procedures assume that the lot fraction defective varies randomly according to a completely unknown and unspecified prior distribution. The unknown prior density function is estimated based on sampling results from previous lots. A procedure is developed for obtaining single-sampling plans that achieve specified posterior consumer and producer risks. The procedures are illustrated for a real-data example. 相似文献
203.
In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made. 相似文献
204.
James G. Taylor 《海军后勤学研究》1974,21(4):683-704
We develop solutions to two fire distribution problems for a homogeneous force in Lanchester combat against heterogeneous enemy forces. The combat continues over a period of time with a choice of tactics available to the homogeneous force and subject to change with time. In these idealized combat situations the lethality of each force's fire (as expressed by the Lanchester attrition-rate coefficient) depends upon time. Optimal fire distribution rules are developed through the combination of Lanchester-type equations for combat attrition and deterministic optimal control theory (Pontryagin maximum principle). Additionally, the theory of state variable inequality constraints is used to treat the nonnegativity of force levels. The synthesis of optimal fire distribution policies was facilitated by exploiting special mathematical structures in these problems. 相似文献
205.
This paper describes a procedure for determining if constrained transportation problems (i.e., transportation problems with additional linear constraints) can be transformed into equivalent pure transportation problems by a linear transformation involving the node constraints and the extra constraints. Our results extend procedures for problems in which the extra constraints consist of bounding certain partial sums of variables. 相似文献
206.
This paper deals with the stationary analysis of the finite, single server queue in discrete time. The following stntionary distributions and other quantities of practical interest are investigated: (1) the joint density of the queue length and the residual service time, (2) the queue length distribution and its mean, (3) the distribution of the residual service time and its mean, (4) the distribution and the expected value of the number of customers lost per unit of time due to saturation of the waiting capacity, (5) the distribution and the mean of the waiting time, (6) the asymptotic distribution of the queue length following departures The latter distribution is particularly noteworthy, in view of the substantial difference which exists, in general, between the distributions of the queue lengths at arbitrary points of time and those immediately following departures. 相似文献
207.
This work is concerned with constructing, analyzing, and finding “mobility chains” for bimatrix games, sequences of equilibrium points along which it is possible for the two players to progress, one equilibrium point at a time, to an equilibrium point that is preferred by both players. The relationship between mobility chains and Nash subsets is established, and some properties of maximal Nash subsets are proved. 相似文献
208.
We consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors. 相似文献
209.
The problem considered involves the assignment of n facilities to n specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs. Assume these n locations are given as points on a two-dimensional plane and transportation costs are proportional to weighted rectangular distances. Then the problem is formulated as a binary mixed integer program. The number of integer variables (all binary) involved equals the number of facilities squared. Without increasing the number of integer variables, the formulation is extended to include “site costs” Computational results of the formulation are presented. 相似文献
210.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献