求解机组组合问题的嵌入贪婪搜索机制的改进粒子群优化算法。
An improved particle swarm optimization algorithm embedded with greedy search for solution of unit commitment.
用改进贪婪算法来处理这种和类似问题，并阐述了“子模性”的概念。
This paper uses a new methodology which improved from normal greed algorithm for detecting this problem in this and related problems, exhibiting the property of "submodularity".
本文对基于虚拟MIMO协作多跳广播的能量最小广播问题进行了探讨，并对其经典贪婪算法GF A进行了改进。
In this paper, describe the minimum energy broadcasting problem which based virtual MIMO cooperative multihop broadcasting schedule, and improve the GFA algorithm.
当然，贪婪演算法的有效性是很容易改进的。
It is, of course, very easy to improve the efficiency of the greedy algorithm.
对于贪婪算法的改进，前向搜索是一种众所周知的技术。
Lookahead search is a well-known technique for improving greedy algorithms.
结合区间最小切负荷的相关理论，使用改进的贪婪随机自适应搜索算法可快速有效的求解该模型。
Combing the theory of interval minimum load cutting problem, the improved greedy randomized adaptive search procedure (GRASP) is used to solve this model.
结合区间最小切负荷的相关理论，使用改进的贪婪随机自适应搜索算法可快速有效的求解该模型。
Combing the theory of interval minimum load cutting problem, the improved greedy randomized adaptive search procedure (GRASP) is used to solve this model.
应用推荐