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    贪婪如狼
• be greedy for money    棺材里伸手-死要钱
• be greedy for sth    忮求
• gluttonous; greedy    贪嘴
• greedy algorithm    式演算法; 贪婪算法; 贪婪演算法; 贪心法; 贪心算法; 饕餮法
• greedy and mean    贪猥
• greedy eyes    贪婪的目光
• greedy method    贪心法
• greedy monkey    贪吃的猴子
• greedy neighbours    恶邻
• greedy scale    贪食圆蚧
• inordinately greedy    巴蛇吞象
• insatiable; greedy    不知足
• the greedy coach    贪婪的教练220
• the greedy mob    贪婪之众
• adaptability of algorithms    算法的适应性
• algorithms for optimization    最优化算法
• algorithms library    算法库
• analysis of algorithms    我想“算法分析
• approximation algorithms    第三十五章 近似算法
• cache algorithms    快取文件置换机制

• The ga is an efficient one can find a better result when the scale of this problem is small and the greedy algorithm performs better when the scale of this problem is larger
  最后,通过对多星区域观测效率优化工具及两个具体的实例进行研究,在实践上验证了模型及算法的有效性。
• As the basis of studying detector generation in eds , several new algorithms are presented . inspired by evolution computing , the thesis firstly analyzes rcb template and rcb greedy algorithm
  借鉴进化计算的成果，提出检测器集生成的rcb模板法和rcb贪婪法，并讨论了遗传算法在检测器集生成中的应用。
• Aimed at the 0 - 1 knapsack problems , the article proposes a kind of hybrid intelligence algorithm combining with the adjusting strategy , the greedy algorithm and the binary particle swarm optimization algorithm
  摘要针对0 - 1背包问题，提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。
• 3 . the theory of the active contour method is introduced systematically , and an improvement of energy function is presented . the experiments with the greedy algorithm give a good result
  3 .系统介绍了主动轮廓线( snake )方法原理和当前的发展状况,在此基础上对能量函数进行了改进,并与贪婪算法相结合,实验效果良好。
• We also have the backward - choice greedy algorithm : if j is the column index subset which we have known , then we choose a column index j " from the subset j , such that which k is the rank of a ( : , j )
  贪婪算法的思想是：每次“最贪婪的”从剩下的子矩阵中选择一列添加到已知的子矩阵中，或“最贪婪的”从已知的子矩阵中消去一列。
• 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问题，该如何求解呢
• 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
  每个算法均基于各自不同的贪婪准则；试验结果表明，每种算法均表现出较高的诊断正确率，并且时间复杂度不高。
• 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三角化为基础，改进了顶点选择的判据，并针对不同类型的多边形采用不同的三角化策略，实现了稳定高效的三角化。
• 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算法) 。