greedy algorithms中文什么意思

• 第十六章 贪婪算法

• greedy:    adj. 1.贪吃的。 2.贪心的，贪婪的 (for; ...
• algorithm:    n. 【数学】算法；规则系统；演段。
• greedy:    adj. 1.贪吃的。 2.贪心的，贪婪的 (for; after; of)。 3.渴望的，热望的 (of; for)。 be greedy of gain [honours] 贪财[名]。 be greedy to do sth. 渴望[急欲]做某事。 adv. -ily ,-iness n.
• algorithms:    算法式
• as greedy as a wolf:    贪婪如狼

例句与用法

1. If / is the column index subset which we have known , then we choose a column index i * from the residual subset i0 i , such that which k is the rank of a ( : , i ) . this method is called the forward - choice greedy algorithm
   实际上，在第三章中，我们只是解决了原矩阵a是列可分的lrms问题，那么对于原矩阵a是列不可分的lrms问题，该如何求解呢
2. Based on greedy algorithm and grouping theory , four probabilistic diagnosis algorithms are presented , and each algorithm has different greedy criterion . experimental results show that every algorithm has high correctness and low time - complexity of diagnosis
   每个算法均基于各自不同的贪婪准则；试验结果表明，每种算法均表现出较高的诊断正确率，并且时间复杂度不高。
3. We have realized stable triangulation and striping methods in radm modeling system . triangulation method , which is based on delaunay triangle algorithm , has been improved on criterion of selected vertex , and striping used local optimize greedy algorithm
   我们在radm系统中以delaunay三角化为基础，改进了顶点选择的判据，并针对不同类型的多边形采用不同的三角化策略，实现了稳定高效的三角化。
4. This main study of paper centralizes on following aspect : 1 . based on shortest path heuristic and greedy algorithms , using path similarity principle and genetic operations , provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ) . 2
   基于最短路径( sph )和greedy算法，使用路径相似性原：理和遗传算法的变异操作，提出了寻找满足1个或2个约束条件的多路径启发式算法(称为k - sph算法) 。

其他语言

greedy algorithms перевод：Задачи, решаемые жадным алгоритмом