全文获取类型
收费全文 | 389篇 |
免费 | 6篇 |
出版年
2021年 | 7篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2014年 | 5篇 |
2013年 | 63篇 |
2012年 | 3篇 |
2009年 | 4篇 |
2008年 | 2篇 |
2007年 | 13篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 10篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 13篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 8篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有395条查询结果,搜索用时 15 毫秒
171.
172.
173.
This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented. 相似文献
174.
Nancy R. Mann 《海军后勤学研究》1978,25(1):121-128
Given herein is an easily implemented method for obtaining, from complete or censored data, approximate tolerance intervals associated with the upper tail of a Weibull distribution. These approximate intervals are based on point estimators that make essentially most efficient use of sample data. They agree extremely well with exact intervals (obtained by Monte Carlo simulation procedures) for sample sizes of about 10 or larger when specified survival proportions are sufficiently small. Ranges over which the error in the approximation is within 2 percent are determined. The motivation for investigation of the methodology for obtaining the approximate tolerance intervals was provided by the new formulation of Lanchester Combat Theory by Grubbs and Shuford [3], which suggests a Weibull assumption for time-to-incapacitation of key targets. With the procedures investigated herein, one can use (censored) data from battle simulations to obtain confidence intervals on battle times associated with given low survivor proportions of key targets belonging to either specified side in a future battle. It is also possible to calculate confidence intervals on a survival proportion of key targets corresponding to a given battle duration time. 相似文献
175.
A primal simplex procedure is developed to solve transportation problems with an arbitrary additional linear constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper. Efficient procedures for pricing-out the basis, determining representations, and implementing the change of basis are presented. These procedures exploit the pure transportation substructure in such a manner that full advantage may be taken of the computational schemes and list structures used to store and update the basis in codifying the MODI method. Furthermore, the pricing-out and change-of-basis procedures are organized in a manner that permits the calculations for one to be utilized in the other. Computational results are presented which indicate that this method is at least 50 times faster than the state-of-the-art LP code, APEX-III. Methods for obtaining basic primal “feasible” starts and “good” feasible integer solutions are also presented. 相似文献
176.
After first formulating the problem of the Marine Environmental Protection program of the Coast Guard as a multiple-objective linear program, we investigate the applicability and limitations of goal programming. We point out how the preemptive goal-programming approach is incompatible with utility preferences. Then we observe the tendency of optimal solutions for standard linear goal programs to occur at extreme points. We also note problems of more general approaches, such as dealing with additively separable approximations to preferences. 相似文献
177.
178.
David R. Denzler 《海军后勤学研究》1969,16(3):411-416
This paper describes an approximate solution method for solving the fixed charge problem. This heuristic approach is applied to a set of test problems to explore the margin of error. The results indicate that the proposed fixed charge simplex algorithm is capable of finding optimal or near optimal solutions to moderate sized fixed charge problems. In the absence of an exact method, this heuristic should prove useful in solving this fundamental nonlinear programming problem. 相似文献
179.
180.
The MAD model presents a mathematic treatment of the relationship between aircraft reliability and maintainability, system manning and inspection policies, scheduling and sortie length, and aircraft downtime. Log normal distributions are postulated for subsystem repair times and simultaneous repair of malfunctions is assumed. The aircraft downtime for maintenance is computed with the distribution of the largest of k log normal distributions. Waiting time for maintenance men is calculated either by using a multiple-channel queuing model or by generating the distribution of the number of maintenance men required and comparing this to the number of men available to determine the probability of waiting at each inspection. 相似文献