| 1. | It is, of course, very easy to improve the efficiency of the greedy algorithm .
当然，贪婪算法的有效性是很容易改进的。 |
| 2. | A modified greedy algorithm for ldpc encoder implementation
编码中贪婪算法的改进 |
| 3. | Greedy algorithm for besov classes
类上的贪婪算法 |
| 4. | A probabilistic algorithm of system - level fault diagnosis based on greedy principle
基于贪婪算法的系统级故障的概率诊断 |
| 5. | The proposed algorithm is compared with the methods based on dynamic programming and greedy
与传统的动态规划法和贪婪算法进行了比较实验。 |
| 6. | Combined with the two greedy algorithms , we also give a combinative - choice greedy algorithm
并且，结合这两种贪婪算法，我们还提出一个混合贪婪算法。 |
| 7. | There are some numerical examples to show that the greedy algorithms work well . finally , we consider the numerical rank lrms
这些贪婪算法(特别是向后贪婪算法和混合贪婪算法)都能够很好的得到所需的最优子矩阵。 |
| 8. | Meanwhile , space decomposition was implemented by eight - branch trees structure in the process of the merger of couple - point which was selected by greedy choice algorithm
在点时合并的过程中使用八叉树结构进行空间分解，使用贪婪算法来选择点对。 |
| 9. | The simulation result indicates that the performance of bspso on knapsack problem , with a quicker convergence , is superior to the greed and genetic algorithms
测试结果表明：采用该算法求解0 / 1背包问题所得的最优解明显优于贪婪算法和遗传算法，且有较快的收敛速度。 |
| 10. | Finally , the solution of minimizing the energy function was obtained by using the modified greedy algorithm , after which , the precise contour of the object was extracted
用改进的贪婪算法求得能量函数最小值，提取出运动目标的精确轮廓，从而得到具有精确边缘的运动目标。 |
