全文获取类型
收费全文 | 580篇 |
免费 | 155篇 |
国内免费 | 58篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 9篇 |
2021年 | 7篇 |
2020年 | 18篇 |
2019年 | 16篇 |
2018年 | 12篇 |
2017年 | 34篇 |
2016年 | 45篇 |
2015年 | 33篇 |
2014年 | 52篇 |
2013年 | 72篇 |
2012年 | 51篇 |
2011年 | 47篇 |
2010年 | 29篇 |
2009年 | 40篇 |
2008年 | 33篇 |
2007年 | 45篇 |
2006年 | 30篇 |
2005年 | 30篇 |
2004年 | 36篇 |
2003年 | 28篇 |
2002年 | 13篇 |
2001年 | 23篇 |
2000年 | 21篇 |
1999年 | 12篇 |
1998年 | 14篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1989年 | 1篇 |
排序方式: 共有793条查询结果,搜索用时 218 毫秒
21.
针对高超声速条件下变形技术的应用模式,对具有伸缩翼的组合式飞行器滑翔弹道进行了多目标优化研究。介绍了伸缩翼的变形模式,给出了不同变形状态下的气动特性;建立了三自由度滑翔轨迹动力学模型和伸缩翼前缘热流计算模型;采用MOEA/D多目标优化算法,以变形条件和飞行攻角为设计变量、以最大射程和最小翼前缘总吸热量为目标函数,进行了多目标优化计算。优化结果表明,MOEA/D计算得到了相对均匀分布的Pareto最优解集,将伸缩翼外形与无变形外形相比,飞行器滑翔段射程得到了显著提高,同时伸缩翼前缘总吸热量有明显的降低。 相似文献
22.
23.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
24.
In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
25.
The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
26.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
27.
设计了一种径向基神经网络(RBF NN)飞行控制器结构,并给出了相应的控制律和参数调节律。由于调节了RBF NN的全部参数(连接权、高斯函数的中心和宽度),得到了很好的控制性能。以F8战斗机为控制对象进行了仿真分析,仿真表明,在存在70%的模型误差的情况下,该控制器仍然能实现较好的跟踪控制,表现出很好的鲁棒性,远远优于传统的只调节连接权值的算法。 相似文献
28.
29.
30.