全文获取类型
收费全文 | 798篇 |
免费 | 346篇 |
国内免费 | 86篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 9篇 |
2021年 | 25篇 |
2020年 | 35篇 |
2019年 | 18篇 |
2018年 | 9篇 |
2017年 | 60篇 |
2016年 | 68篇 |
2015年 | 49篇 |
2014年 | 63篇 |
2013年 | 55篇 |
2012年 | 80篇 |
2011年 | 67篇 |
2010年 | 41篇 |
2009年 | 88篇 |
2008年 | 58篇 |
2007年 | 62篇 |
2006年 | 70篇 |
2005年 | 54篇 |
2004年 | 56篇 |
2003年 | 36篇 |
2002年 | 37篇 |
2001年 | 27篇 |
2000年 | 31篇 |
1999年 | 22篇 |
1998年 | 23篇 |
1997年 | 15篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 8篇 |
1989年 | 2篇 |
排序方式: 共有1230条查询结果,搜索用时 46 毫秒
91.
基于小波变换和进化网络提出一种有效的常规雷达目标识别方法。即首先利用 Mallat算法对雷达目标一维距离像进行特征提取和压缩 ,然后在进化规划的基础上提出一种混合进化算法来优化设计由多层前向网络构成的分类器。实验结果表明 ,整个目标识别系统的结构简单 ,同时具有较好的推广能力 相似文献
92.
用人工神经网络BP算法评价城市火灾风险 总被引:2,自引:0,他引:2
吴立志 《中国人民武装警察部队学院学报》2001,17(3):30-32
深入讨论了人工神经网络的BP算法在城市火灾风险评价中应用的可行性和一些具体做法. 相似文献
93.
基于遗传算法的涡轮增压器叶轮优化设计 总被引:2,自引:0,他引:2
提出了一种基于遗传优化理论的涡轮增压器叶轮的优化设计方法,论述了以涡轮增压器叶轮能量损失最小为目标函数,以叶轮叶片进口角、进口直径、进口宽度、出口直径、叶片数、出口角为设计变量的涡轮增压器叶轮的优化设计模型及优化计算的方法,数值计算表明,这种算法可以方便地求得具有最小涡轮损失的涡轮叶形参数. 相似文献
94.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
95.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
96.
97.
针对小波分析在机械故障诊断应用中的快速算法和小波基选择存在的问题,对常用的正交、半正交、双正交小波提取信号特征的能力进行了分析比较,研究表明半正交B样条小波因具有线性相位和采用较长的分解序列而具有较好的频率局部化特性和较小的变换误差,具有比较好的综合性能。推导了正交小波包的图形显示算法,利用该算法解决了小波变换快速算法中存在的数据长度随分解层数成倍减小的问题。研究结果为机械故障诊断中选择小波基进行信号处理提供了依据和途径。 相似文献
98.
99.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
100.
In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000 相似文献