全文获取类型
收费全文 | 393篇 |
免费 | 95篇 |
国内免费 | 65篇 |
专业分类
553篇 |
出版年
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 10篇 |
2020年 | 12篇 |
2019年 | 9篇 |
2018年 | 11篇 |
2017年 | 26篇 |
2016年 | 30篇 |
2015年 | 25篇 |
2014年 | 39篇 |
2013年 | 40篇 |
2012年 | 40篇 |
2011年 | 34篇 |
2010年 | 30篇 |
2009年 | 46篇 |
2008年 | 27篇 |
2007年 | 30篇 |
2006年 | 26篇 |
2005年 | 28篇 |
2004年 | 17篇 |
2003年 | 10篇 |
2002年 | 9篇 |
2001年 | 11篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1992年 | 2篇 |
1990年 | 3篇 |
排序方式: 共有553条查询结果,搜索用时 15 毫秒
121.
在界定基于能力的武器装备体系需求生成相关概念的基础上,对需求生成模式进行了总体分析,对需求生成过程按照作战任务分解描述、能力体系需求分析和装备体系需求生成进行了详细描述,初步形成了武器装备体系需求生成研究的基本框架。 相似文献
122.
覆土油罐储油是世界各国石油战略储备的重要方式之一,如何提高其抗震性能是构建覆土油罐的重要内容。针对覆土油罐罐室与护体结构的特点,在前人对地下结构抗震研究的基础上,建立围墙与周围回填土层的简化动力模型,运用相互作用法,给出围墙与周围回填土层在横向地震作用下的动力方程,借助Matlab数值分析软件,讨论了结构频率比、刚度比、阻尼比、阻尼率比、质量比对结构位移放大系数的影响,分析所得结论对覆土油罐的构筑施工有一定的参考价值。 相似文献
123.
Andreas Schirmer 《海军后勤学研究》2000,47(3):201-222
Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000 相似文献
124.
125.
126.
基于CPN建模的行动方案开发与分析系统设计 总被引:1,自引:0,他引:1
协助和支持军事计划人员制订和分析作战计划的建模与仿真能力是军方的现行需求,而行动方案的开发与分析则是作战计划建模与仿真的重点。针对作战计划过程期间开发的军事任务的排序与调度问题,设计了一个行动方案开发与分析系统,系统采用客户机-服务器体系结构,运用基于有色Petri网建模的军事计划领域的概念表示法,并使用状态空间分析技术完成军事任务的自动化排序与调度。军事计划人员通过图形用户界面使用系统,在面对紧急突发事件时,可以快速及时地开发出适当可行的COA,并对COA进行逻辑可行性分析。 相似文献
127.
128.
129.
We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
130.
基于特征点匹配的图像拼接算法研究 总被引:3,自引:0,他引:3
陈虎 《海军工程大学学报》2007,19(4):94-97
通过查找待拼接两幅图像的对应特征点以确定两幅图像的缝合点,进而确定两者的匹配位置,通过对图像的重叠区域进行平滑过渡处理,实现了待拼接图像的无缝拼接。实验结果表明,文中所提算法合理,取得了良好的效果。 相似文献