全文获取类型
收费全文 | 230篇 |
免费 | 106篇 |
国内免费 | 32篇 |
出版年
2024年 | 3篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 1篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 3篇 |
2017年 | 12篇 |
2016年 | 16篇 |
2015年 | 12篇 |
2014年 | 22篇 |
2013年 | 21篇 |
2012年 | 29篇 |
2011年 | 21篇 |
2010年 | 16篇 |
2009年 | 17篇 |
2008年 | 23篇 |
2007年 | 22篇 |
2006年 | 21篇 |
2005年 | 18篇 |
2004年 | 18篇 |
2003年 | 15篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 8篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有368条查询结果,搜索用时 15 毫秒
171.
172.
对加速寿命试验设计优化的相关知识进行研究分析,确定以竞争失效产品恒应力加速寿命试验为应用背景。在对加速寿命试验统计分析深入研究的基础上,通过分析方案要素、约束条件等建立优化目标函数,提出基于模拟退火算法的优化方法和具体实现思路。最后通过实例验证方法的可行性和实用性。 相似文献
173.
174.
This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
175.
针对开源编译器Open64存在MPI不能自动并行化的问题,对Open64中面向Cluster的MPI代码自动生成进行了研究。分析了MPI代码自动生成模块在Open64体系结构中的位置,提出了基于Open64的MPI代码自动生成算法,并对其进行了实验验证。实验结果表明:该算法不但能够有效降低MPI并行程序的通信开销,而且能够明显提高其加速比。 相似文献
176.
基于作战功能模块设计的武器装备体系需求生成方法框架研究 总被引:1,自引:0,他引:1
以FoS(Family of Systems)武器装备体系需求生成为研究对象,构建基于作战功能模块设计的武器装备体系需求生成框架,提出适用于该方法框架的基于目标-概念-任务的作战任务需求分析方法、基于任务-功能的作战能力分析方法,从实践角度实现了模块化作战力量建设与FoS武器装备体系模块化、综合化、集成化建设的一体化设计,为武器装备体系需求生成提供了新的方法框架。 相似文献
177.
178.
179.
为克服图像识别中传统方法需要进行高维矩阵奇异值分解的困难,提出了先局部降维再总体降维的组合变换方法.ORL人脸图像数据库的实验表明,这一方法不仅减少了运算量,而且能较好地解决人脸这样一类复杂的图像识别问题;总体来说优于传统的基于KL变换的识别方法. 相似文献
180.
The deterministic problem for finding an aircraft's optimal risk trajectory in a threat environment has been formulated. The threat is associated with the risk of aircraft detection by radars or similar sensors. The model considers an aircraft's trajectory in three‐dimensional (3‐D) space and represents the aircraft by a symmetrical ellipsoid with the axis of symmetry directing the trajectory. Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, a solution to this equation is expressed by a quadrature. A network optimization approach reduces the original problem to the Constrained Shortest Path Problem (CSPP) for a 3‐D network. The CSPP has been solved for various ellipsoid shapes and different length constraints in cases with several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact of variable RCS on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献