全文获取类型
收费全文 | 731篇 |
免费 | 17篇 |
出版年
2021年 | 7篇 |
2019年 | 17篇 |
2018年 | 13篇 |
2017年 | 17篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2013年 | 134篇 |
2011年 | 9篇 |
2010年 | 7篇 |
2009年 | 10篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 16篇 |
2004年 | 14篇 |
2003年 | 9篇 |
2000年 | 10篇 |
1999年 | 9篇 |
1998年 | 7篇 |
1997年 | 11篇 |
1996年 | 20篇 |
1995年 | 6篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 24篇 |
1990年 | 9篇 |
1989年 | 17篇 |
1988年 | 9篇 |
1987年 | 17篇 |
1986年 | 18篇 |
1985年 | 22篇 |
1984年 | 12篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 13篇 |
1979年 | 10篇 |
1978年 | 10篇 |
1977年 | 13篇 |
1976年 | 12篇 |
1975年 | 7篇 |
1974年 | 16篇 |
1973年 | 10篇 |
1972年 | 17篇 |
1971年 | 17篇 |
1970年 | 10篇 |
1969年 | 10篇 |
1968年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有748条查询结果,搜索用时 15 毫秒
161.
162.
163.
Properties of a finite-range failure-time distribution, that includes the exponential as a particular case, have been studied. The distribution is IFR when the shape parameter exceeds unity, but is IFRA always. For a given value of the shape parameter, the distribution is NBUE over a segment of its range. Estimators of parameters have been derived. Distributions of two-component series, parallel, and standby system lives have also been worked out. 相似文献
164.
In this article, we describe a new algorithm for solving all-integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all-integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all-integer algorithm of Gomory, but we incorporate certain row- and column-selection criteria which partially avoid the problem of dual-degenerate iterations. We present the results of computational testing. 相似文献
165.
A series of independent trials is considered in which one of k ≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to the k vector of probabilities for each outcome. Applications to series of races involving k runners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcome i is k?1 (i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem are addressed. 相似文献
166.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods. 相似文献
167.
A unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and xi ? 0, integer; where vi, wi and W are known integers, and wi (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi-dimensional case, are also considered. 相似文献
168.
Exact first and second order moments of order statistics from the truncated exponential distribution
Exact expressions for the first and second order moments of order statistics from the truncated exponential distribution, when the proportion 1–P of truncation is known in advance, are presented in this paper. Tables of expected values and variances-covariances are given for P = 0.5 (0.1) 0.9 and n = 1 (1) 10. 相似文献
169.
170.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献