全文获取类型
收费全文 | 513篇 |
免费 | 19篇 |
出版年
2021年 | 12篇 |
2019年 | 14篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 17篇 |
2014年 | 10篇 |
2013年 | 90篇 |
2011年 | 7篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 6篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 11篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 11篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 9篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 17篇 |
1985年 | 10篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 11篇 |
1980年 | 5篇 |
1979年 | 13篇 |
1978年 | 8篇 |
1977年 | 10篇 |
1975年 | 10篇 |
1974年 | 11篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 6篇 |
1970年 | 4篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 3篇 |
1966年 | 5篇 |
排序方式: 共有532条查询结果,搜索用时 0 毫秒
111.
Several approximate procedures are available in the literature for obtaining confidence intervals for the parameter A of an exponential distribution based on time truncated samples. This paper contains the results of an empirical study comparing three of these procedures. 相似文献
112.
This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch-bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix. 相似文献
113.
114.
A. S. Goldman 《海军后勤学研究》1969,16(1):111-120
Although industry is expected to design hardware to fit into a general support system and to be capable of arguing life-cycle system costs, adequate information has not been available on the support system in terms of policies and operating decision rules. Policies and operating decisions by users dominate engineering design decisions in determining life-cycle support costs. The relative effect of each of these decision areas on support costs has yet to be resolved empirically. Without an understanding of the sensitivity of support costs to alternative designs, capability is limited in design improvement and support of end items. Life-cycle costing of analysis under cost-effectiveness and the maintainability of integrated logistics support is open to question. 相似文献
115.
Although cycling in the simplex method has long been known, a number of theoretical questions concerning cycling have not been fully answered. One of these, stated in [3], is to find the smallest example of cycling, and Beale's example with three equations and seven variables is conjectured to be the smallest one. The exact bounds on dimensions of cycling examples are established in this paper. We show that Beale's example is the smallest one which cycles at a non-optimal solution, that a smaller one can cycle at the optimum, and that, in general (including the completely degenerate case), a cycling example must have at least two equations, at least six variables, and at least three non-basic variables. Examples and geometries are given for the extreme cases, showing that the bounds are sharp. 相似文献
116.
117.
118.
119.
A sequential decision problem is considered in which N particles have to cross a given field. Two alternative crossing paths are available. An unknown number of absorption points J1 and J2 are planted at each of the crossing paths. The bivariate prior distribution of (J1,J2) is given. If a particle passes close to an absorption point it may survive with probability s, 0 < s < 1. If a particle is absorbed, both the particle and the absorption point are ruined. There is no replacement of ruined absorption points. All absorption points act independently. The particles crciss the field in a consecutive order, and a crossing path can be chosen for each particle. The objective is to maximize the expected number of survivors. The Bayes sequential procedure is characterized. The csmditions under which the Bayes strategy is determined by the maximal posterior survival probabilities are specified. 相似文献
120.
George S. Fishman 《海军后勤学研究》1985,32(2):249-261
This article describes a new procedure for estimating parameters of a stochastic activity network of N arcs. The parameters include the probability that path m is the longest path, the probability that path m is the shortest path, the probability that arc i is on the longest path, and the probability that arc i is on the shortest path. The proposed procedure uses quasirandom points together with information on a cutset ? of the network to produce an upper bound of O[(log K)N?|?|+1/K] on the absolute error of approximation, where K denotes the number of replications. This is a deterministic bound and is more favorable than the convergence rate of 1/K1/2 that one obtains from the standard error for K independent replications using random sampling. It is also shown how series reduction can improve the convergence rate by reducing the exponent on log K. The technique is illustrated using a Monte Carlo sampling experiment for a network of 16 relevant arcs with a cutset of ? = 7 arcs. The illustration shows the superior performance of using quasirandom points with a cutset (plan A) and the even better performance of using quasirandom points with the cutset together with series reduction (plan B) with regard to mean square error. However, it also shows that computation time considerations favor plan A when K is small and plan B when K is large. 相似文献