全部

1·Improve a greedy algorithm for discretization of continuous attribute.

改进了连续属性离散化的贪心算法。

2·An ideal result can be obtained by using second-order greedy algorithm.

用二次贪心算法求解，可获得比较理想的结果。

3·The greedy algorithm gets solution of a problem through a series of choices.

贪心算法是通过一系列的选择来得到一个问题的解。

4·It is, of course, very easy to improve the efficiency of the greedy algorithm.

当然，贪婪演算法的有效性是很容易改进的。

5·We'll start with the greedy thief. Well, the greedy thief follows the greedy algorithm.

我们从贪婪的贼开始，这个贪婪的贼按贪婪算法行动。

6·What do you get if you follow the greedy algorithm? What's the first thing the thief does?

如果年贪婪算法你会带走什么呢？，这个贼做的第一件事是什么？

7·However, in most cases, the tree constructed by greedy algorithm is not optimal globally.

然而，在大多数情况下，贪婪算法构造的树不是全局最优的。

8·Should I expect to have exactly same match everytime I run the match with greedy algorithm?

我应该会有完全相同的比赛，每次运行与贪婪算法？

9·We proposed a decorrelating multiuser detection based on greedy algorithm for CDMA communication.

在此，提出了一种基于贪心算法的解相关CDMA多用户检测方法。

10·Then, considering complexity of greedy algorithm, this paper proposes a modified greedy algorithm.

该算法通过修改迭代过程的初始条件，大大简化了贪婪算法的计算复杂度。