全文获取类型
收费全文 | 47篇 |
免费 | 40篇 |
国内免费 | 5篇 |
出版年
2022年 | 1篇 |
2020年 | 1篇 |
2017年 | 4篇 |
2016年 | 2篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2010年 | 6篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 7篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有92条查询结果,搜索用时 17 毫秒
31.
网格方程组并行计算预条件迭代若干性质及应用 总被引:3,自引:0,他引:3
对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算 相似文献
32.
Statistical estimation plays an important role in locating a target in space, a task that has important applications in many areas. However, theoretical measures on the quality of various estimators reported in the literature have been difficult to obtain because of mathematical complications. As a result, choice of estimator in practice has been largely arbitrary. In this paper, we present a systematic study on major target estimators reported in the literature. Focus is on comparisons between the traditional angle method, the line method, and a recently developed line-to-point transformation method. Insights gained from the study directly lead to the development of a novel two-stage angle method that not only produces highly accurate target estimation among all known estimators but is also computationally efficient. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 353–364, 1998 相似文献
33.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
34.
针对序列近似优化方法在代理模型构造与采样策略等方面的不足,基于采样点局部密度,引入与局部密度成反比的样本点影响体积概念,通过优化总影响体积确定径向基函数最优核宽度,满足序列近似优化过程不同规模、非均匀样本条件下的函数近似需要;建立潜在可行域最大距离加点准则,并与潜在最优加点准则结合平衡算法的探索能力与开发能力;建立三步收敛判定准则;构建改进序列近似优化的算法流程。对于Golinski减速器的优化设计问题,算法在目标函数调用42次后便搜索到全局最优解,体现了其良好的全局寻优能力与搜索效率。以"天航二号"火箭为例,建立其外形优化问题数学模型,所提优化方法在调用原始计算模型165次之后便搜索到全局最优解,大大提高了设计效率,同时飞行试验也表明设计结果满足要求。 相似文献
35.
文中就解Dirichlet 边界条件的Poisson 方程给出了FACR(L)算法及其并行实现过程,讨论了FACR(L)算法的计算复杂性,给出了针对向量机YH—1的算法的参数L 的优选公式,在YH—1机上得到了较为理想的,数值试验结果。 相似文献
36.
37.
作为未来高性能计算研究的重要方向,量子计算受到了全世界的高度重视。文章简单介绍了量子计算的基本原理和研究现状,并对量子计算的未来发展作了分析与思考。 相似文献
38.
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014 相似文献
39.
针对适应值计算费时的优化问题,提出一种具有适应值预测机制的遗传算法:为了有效控制预测适应值的准确度和预测频率,建立了一个基于可信度概念的适应值预测模型,引入可信度流失机制以减少预测误差的传播和累积,引入冗余个体剔除机制以减少计算消耗。利用3个基准函数对算法进行收敛性和有效性的测试,测试结果表明算法对于3个测试函数均能获得满意的最优解,并且都能减少60%以上的真实适应值计算次数。 相似文献
40.
为使任意大小、任意距离的两同轴圆线圈之间的互感系数能用关系简单明了的常用解析函数表示,先对用毕奥-萨伐尔定律导出的互感系数积分公式进行数值计算,然后通过对极端情况的分析和对非极端情况进行猜想,采用幂级数、指数、对数或其组合进行试探,再用数值计算验证,最终尝试性地分6种情形给出了两同轴圆线圈在任意大小、任意距离下(除两线圈几乎重合外)互感系数的近似解析表达式。函数表达式比较简单,物理意义比较明确,且相对误差在±5%以内。 相似文献