全文获取类型
收费全文 | 345篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 6篇 |
2013年 | 56篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 7篇 |
2009年 | 3篇 |
2007年 | 7篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2002年 | 9篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 10篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有359条查询结果,搜索用时 15 毫秒
331.
Frederic H. Murphy 《海军后勤学研究》1976,23(3):461-467
An improved theoretical rate of convergence is shown for a member of the class of exponential penalty function algorithms. We show that the algorithm has a superlinear convergence rate. 相似文献
332.
Jatinder N. D. Gupta 《海军后勤学研究》1976,23(2):235-243
In this paper the problem of finding an optimal schedule for the n-job, M-machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed. 相似文献
333.
Moment and maximum likelihood estimates (m.l.e.'s) arc investigated for nonparametric and parametric models for a single server queue observed over a random time horizon, namely, up to the nth departure epoch. Also. m.l.e's of the mean interarrival time and mean service time in anM/M/1 queue observed over a fixed time-interval are studied Limit distributions of these estimates are obtained Without imposing steady state assumptions on the queue-size or waiting time processes. 相似文献
334.
Recent research has led to several surrogate multiplier search procedures for use in a primal branch-and-bound procedure. As single constrained integer programming problems, the surrogate subproblems are also solved via branch-and-bound. This paper develops the inner play between the surrogate subproblem and the primal branch-and-bound trees which can be exploited to produce a number of computational efficiencies. Most important is a restarting procedure which precludes the need to solve numerous surrogate subproblems at each node of a primal branch-and-bound tree. Empirical evidence suggests that this procedure greatly reduces total computation time. 相似文献
335.
In this paper we consider a simple three-order-statistic asymptotically unbiased estimator of the Weibull shape parameter c for the case in which all three parameters are unknown. Optimal quantiles that minimize the asymptotic variance of this estimator, c? are determined and shown to depend only on the true (unknown) shape parameter value c and in a rather insensitive way. Monte Carlo studies further verified that, in practice where the true shape parameter c is unknown, using always c? with the optimal quantities that correspond to c = 2.0 produces estimates, c?, remarkably close to the theoretical optimal. A second stage estimation procedure, namely recalculating c? based on the optimal quantiles corresponding to c?, was not worth the additional effort. Benchmark simulation comparisons were also made with the best percentile estimator of Zanakis [20] and with a new estimator of Wyckoff, Bain and Engelhardt [18], one that appears to be the best of proposed closed-form estimators but uses all sample observations. The proposed estimator, c?, should be of interest to practitioners having limited resources and to researchers as a starting point for more accurate iterative estimation procedures. Its form is independent of all three Weibull parameters and, for not too large sample sizes, it requires the first, last and only one other (early) ordered observation. Practical guidelines are provided for choosing the best anticipated estimator of shape for a three-parameter Weibull distribution under different circumstances. 相似文献
336.
The dynamic transportation problem is a transportation problem over time. That is, a problem of selecting at each instant of time t, the optimal flow of commodities from various sources to various sinks in a given network so as to minimize the total cost of transportation subject to some supply and demand constraints. While the earliest formulation of the problem dates back to 1958 as a problem of finding the maximal flow through a dynamic network in a given time, the problem has received wider attention only in the last ten years. During these years, the problem has been tackled by network techniques, linear programming, dynamic programming, combinational methods, nonlinear programming and finally, the optimal control theory. This paper is an up-to-date survey of the various analyses of the problem along with a critical discussion, comparison, and extensions of various formulations and techniques used. The survey concludes with a number of important suggestions for future work. 相似文献
337.
This paper provides an overview of the Computer-Assisted Search Planning (CASP) system developed for the United States Coast Guard. The CASP information processing methodology is based upon Monte Carlo simulation to obtain an initial probability distribution for target location and to update this distribution to account for drift due to currents and winds. A multiple scenario approach is employed to generate the initial probability distribution. Bayesian updating is used to reflect negative information obtained from unsuccessful search. The principal output of the CASP system is a sequence of probability “maps” which display the current target location probability distributions throughout the time period of interest. CASP also provides guidance for allocating search effort based upon optimal search theory. 相似文献
338.
339.
A general result for obtaining recurrence relations between single moments of order statistics is obtained and has been used to establish the recurrence relations between moments of some doubly truncated distributions. The examples considered are Weibull, exponential, Pareto, power function, Cauchy, and logistic. Recurrence relations are also obtained for nontruncated gamma and beta distributions. 相似文献
340.
As it has grappled with issues of population policy, the international community has emphasized that women's reproductive rights are human rights. Scholars have also acknowledged that the right to reproductive health care exists within the scope of international human rights treaties and conventions and that gender equality, nondiscrimination, and freedom from government interference in marriage and family life are also guaranteed. Further protections extend to counseling and health information and referral. The Programme of Action of the 1994 International Conference on Population and Development continues this trend by emphasizing the importance of human rights for attaining population and development objectives, calling on governments to focus their efforts on improving the quality of life for individuals, and endorsing the notion that reproductive rights are universal human rights. Reproductive health care options are also influenced by sovereign laws that restrict availability of contraception, sterilization, or abortion. However, universal rights and unrestricted access must be complemented by other factors controlled by domestic laws to guarantee reproductive choice. Such laws cover issues like marriage age, divorce, marital property, child support, maternity benefits, day care, sex discrimination, eligibility for insurance, confidentiality, spousal consent, rape, and sexual abuse. Countries must modify restrictive national laws and promote laws protecting women's rights. 相似文献