首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   665篇
  免费   0篇
  665篇
  2021年   11篇
  2019年   22篇
  2018年   12篇
  2017年   14篇
  2016年   14篇
  2015年   12篇
  2014年   11篇
  2013年   130篇
  2009年   7篇
  2008年   9篇
  2007年   7篇
  2005年   9篇
  2004年   11篇
  2003年   8篇
  2002年   12篇
  2001年   6篇
  2000年   9篇
  1999年   7篇
  1998年   11篇
  1997年   19篇
  1996年   10篇
  1995年   8篇
  1994年   15篇
  1993年   6篇
  1992年   9篇
  1991年   17篇
  1990年   9篇
  1989年   9篇
  1988年   10篇
  1987年   21篇
  1986年   12篇
  1985年   11篇
  1984年   7篇
  1983年   11篇
  1982年   12篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   8篇
  1977年   9篇
  1976年   8篇
  1975年   9篇
  1974年   10篇
  1973年   14篇
  1972年   8篇
  1971年   7篇
  1970年   8篇
  1969年   9篇
  1968年   6篇
  1967年   7篇
排序方式: 共有665条查询结果,搜索用时 0 毫秒
191.
This paper pruvides a smaller equivalelnt bounded variable transportation problem than that in Charnes, Glover, and Klingman [1] for the lower bounded and partial upper bounded distribution model.  相似文献   
192.
This paper deals with the numerical problems arising in the computation of higher order moments of the busy period for certain classical queues of the M|G|I type, both in discrete and in continuous time The classical functional equation for the moment generating function of the busy period is used. The higher order derivatives at zero of the moment generating function are computed by repeated use of the classical differentiation formula of Fá di Bruno. Moments of order up to fifty may be computed in this manner A variety of computational aspects of Fá di Bruno's formula, which may be of use in other areas of application, are also discussed in detail.  相似文献   
193.
We present a branch and bound algorithm to solve mathematical programming problems of the form: Find x =|(x1,…xn) to minimize Σ?i0(x1) subject to x?G, l≦x≦L and Σ?i0(x1)≦0, j=1,…,m. With l=(l1,…,ln) and L=(L1,…,Ln), each ?ij is assumed to be lower aemicontinuous and piecewise convex on the finite interval [li.Li]. G is assumed to be a closed convex set. The algorithm solves a finite sequence of convex programming problems; these correspond to successive partitions of the set C={x|l ≦ x ≦L} on the bahis of the piecewise convexity of the problem functions ?ij. Computational considerations are discussed, and an illustrative example is presented.  相似文献   
194.
In this article we address the question of developing deep cuts for disjunctive programs using rectilinear distance measures. The method is applied to linear complementarity problems where the matrix M need not be copositive plus. Some modifications that are needed as a computational expediency are discussed. The computation results for matrix M of size up to 30 × 30 are discussed.  相似文献   
195.
One branch of the reliability literature is concerned with devising statistical procedures with various nonparametric “restricted family” model assumptions because of the potential improved operating characteristics of such procedures over totally nonparametric ones. In the single-sample problem with unknown increasing failure rate (IFR) distribution F, (1) maximum-likelihood estimators of F have been calculated, (2) upper or lower tolerance limits for F have been determined, and (3) tests of the null hypothesis that F is exponential have been constructed. Barlow and Campo proposed graphical methods for assessing goodness of fit to the IFR model when the validity of this assumption is unknown. This article proposes several analytic tests of the IFR null hypothesis based on the maximum distance and area between the cumulative hazard function and its greatest convex minorant (GCM), and the maximum distance and area between the total time on test statistic and its GCM. A table of critical points is provided to implement a specific test having good overall power properties.  相似文献   
196.
One important thrust in the reliability literature is the development of statistical procedures under various “restricted family” model assumptions such as the increasing failure rate (IFR) and decreasing failure rate (DFR) distributions. However, relatively little work has been done on the problem of testing fit to such families as a null hypothesis. Barlow and Campo proposed graphical methods for assessing goodness of fit to the IFR model in single-sample problems. For the same problem with complete data, Tenga and Santner studied several analytic tests of the null hypothesis that the common underlying distribution is IFR versus the alternative that it is not IFR for complete data. This article considers the same problem for the case of four types of censored data: (i) Type I (time) censoring, (ii) Type I1 (order statistic) censoring, (iii) a hybrid of Type I and Type I1 censoring, and (iv) random censorship. The least favorable distributions of several intuitive test statistics are derived for each of the four types of censoring so that valid small-sample-size α tests can be constructed from them. Properties of these tests are investigated.  相似文献   
197.
198.
199.
Results of Geoffrion for efficient and properly efficient solutions of multiobjective programming problems are extended to multiobjective fractional programming problems. Duality relationships are given for these problems where the functions are generalized convex or invex.  相似文献   
200.
Empirical distance functions are used to estimate actual travel distances in a transportation network, to verify the accuracy of road mileage data, and to formulate continuous location models. In this article we consider the problem of fitting the weighted lp norm to a given network. Mathematical properties are derived for two fitting criteria found in the literature. These properties are used to develop an accurate and efficient methodology to solve for the best-fitting parameter values. The directional bias of the lp norm is analyzed for its effect on the range of search for the optimal p value. Concepts and methodology are applied to a case study of the road system in Southern Ontario. In conclusion, a general framework for other types of distance functions is briefly discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号