全文获取类型
收费全文 | 294篇 |
免费 | 72篇 |
国内免费 | 18篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 7篇 |
2021年 | 16篇 |
2020年 | 11篇 |
2019年 | 16篇 |
2018年 | 10篇 |
2017年 | 16篇 |
2016年 | 20篇 |
2015年 | 17篇 |
2014年 | 19篇 |
2013年 | 25篇 |
2012年 | 27篇 |
2011年 | 21篇 |
2010年 | 15篇 |
2009年 | 29篇 |
2008年 | 16篇 |
2007年 | 20篇 |
2006年 | 15篇 |
2005年 | 16篇 |
2004年 | 12篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 5篇 |
排序方式: 共有384条查询结果,搜索用时 437 毫秒
161.
装备保障信息资源规划框架设计 总被引:3,自引:0,他引:3
分析了我军装备保障信息资源的现状,找出了信息资源建设中存在的主要问题。针对我军装备保障实际,依据信息资源规划理论,提出了装备保障信息资源规划的总体方案框架及工程化方法。旨在为装备保障信息系统的开发打下基础,以促进装备保障信息化建设的进程。 相似文献
162.
We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
163.
This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
164.
数据拟合加速寿命试验智能优化设计 总被引:1,自引:0,他引:1
加速寿命试验方案的优劣,直接影响着试验的成本、效益和试验结果的准确性,因此有必要对试验方案进行优化设计,寻找最佳应力水平和试样分配比例,使加速寿命试验的结果最准确、代价最小.利用目标函数的连续性,提出一种基于离散数据的拟合方法,将加速寿命试验的优化设计转化为显函数的约束极值求解问题,然后将智能优化算法应用到加速寿命试验... 相似文献
165.
通过分析火力分配、区域划分、航路规划三者的关系,提出了舰艇编队导弹航路规划三位一体战术决策的思想.设计了一个以此为背景,基于高层体系结构(HLA)的可扩展、开放式仿真体系结构.依据HLA/RTI规范,设计开发了仿真联邦的联邦/仿真对象模型.基于系统的离散事件仿真特征,采用事件调度的仿真策略,利用Petri网建立了系统的... 相似文献
166.
167.
针对装备作战仿真环境下,弹药消耗预测计算时间长、实时仿真速度慢的问题,以战役战术火力毁伤弹药需求预测计算方法为主线,以人工神经网络为技术支持,提出了智能化的弹药消耗预测方法。通过遗传算法对网络连接权值的训练及优化,以及误差目标函数的改进与隐含层神经元数目的智能选取,提高弹药消耗预测的实时仿真速度,为下一步的弹药消耗预测研究提供了理论参考与方法支持。 相似文献
168.
自动化电弧喷涂路径偏移间距的优化模型 总被引:1,自引:0,他引:1
基于电弧喷涂沉积丘的轮廓呈高斯分布的假设,并结合实验结果,建立了电弧喷涂沉积丘轮廓的数学模型,由此推导出了自动化喷涂过程中平行路径偏移间距这一重要参量的优化模型。该模型为合理规划自动化喷涂的路径提供了依据。 相似文献
169.
170.
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 相似文献