全文获取类型
收费全文 | 156篇 |
免费 | 61篇 |
国内免费 | 8篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 3篇 |
2018年 | 8篇 |
2017年 | 11篇 |
2016年 | 15篇 |
2015年 | 8篇 |
2014年 | 13篇 |
2013年 | 12篇 |
2012年 | 10篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 16篇 |
2008年 | 13篇 |
2007年 | 12篇 |
2006年 | 8篇 |
2005年 | 8篇 |
2004年 | 12篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 8篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1990年 | 3篇 |
排序方式: 共有225条查询结果,搜索用时 171 毫秒
81.
周春莲 《装甲兵工程学院学报》1998,(3)
本文在如下情况:(1)取定P(1≤P≤8),设K_i=8l_i P(i=1,…,l),k_2>9/4(k_1-1)>O;(2)取定整数q(l≤q≤4)式,设k_1=4t_1 q(i=1,…,l),k_2>5/2(k_1-1)>0满足时,决定了一些非常非常余维数的未定向协边子群J_n~(k_1…k_l). 相似文献
82.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
83.
用混合有限元模型分析船体振动问题研究 总被引:11,自引:4,他引:7
对混合有限元模型应用于船体振动分析的方法进行了讨论,并建立了某船的混合有限元模型,分别对其船体总振动和局部振动进行了计算.计算结果表明,混合有限元模型的总振动计算结果略小于迁移矩阵法,而局部振动计算结果与孤立模型存在较大差异. 相似文献
84.
线性回归模型系数Stein估计的改进研究 总被引:8,自引:0,他引:8
针对线性回归模型病态的根本原因,提出了一类新的估计———c-k型估计,将岭估计与Stein估计统一到一个估计类;研究了这一估计类,证明利用岭回归技术可以改进著名的Stein估计(在均方误差意义下);同时研究了相应参数的最优值,分别给出了它的一个上界及下界,为病态线性回归模型系数的有偏估计提供了改进的技术途径. 相似文献
85.
86.
Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
87.
一种发动机万有特性曲面拟合的新方法 总被引:2,自引:0,他引:2
通过分析发动机实测试验数据,提出了燃油消耗率同转速和扭矩之间存在类似幂指函数的关系,运用多元回归的方法对发动机的万有特性曲面进行了拟合,对拟合结果用数理统计的方法进行了检验,最后指出对发动机万有特性曲面的拟合采用分段函数进行数值计算,将得到更为精确的结果。 相似文献
88.
89.
This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
90.