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    快取文件置换机制

• Two interactive segmentation methods , snake ( active contour ) and live wire , which are very popular , have been introduced for the medical image segmentation . a snake is a spline curve , which is controlled by an energy equation . to minimize the snake ' s total energy , the finite difference and greedy algorithm have been implemented
  论文引入了snake和livewire两种十分流行的医学图像交互分割方法，详细推导snake的能量方程，实现了最小化能量方程的有限差分和greedy两种算法，并利用邻近图像的相似性，将其成功应用于图像序列的分割； livewire是一种象素级的轮廓搜索算法，它在方向图中找到开始点和目标点之间的最小代价路径。
• In the case of the maximal observed area model , the complexity of the problem was studied first , and come to the conclusion that this solve problem of this model is a np problem . so , genetic algorithm ( ga ) and greedy algorithm is applied to solve this problem
  对空间覆盖率优先问题,分别应用遗传算法及贪婪算法对其实现了近似求解,并通过对这两种不同求解算法的特点及复杂性进行分析,明确了这两种算法的适用条件;随机实验也进一步说明了两种算法的优缺点所在。
• To deal with the question that how we can guarantee the dna sequences which are stored in the personal dna database are anonymous , that no one can find out whom a special dna sequence is collected from , this paper get a new method ? savior , by improve dnala ( dna lattice anonymization ) , which is a method settling this question . savior replaces the multiple alignment in dnala with pairwise alignment between every tow sequences , and replaces the greedy algorithm in dnala with stochastic hill - climbing . for doing this , it can save the time for data pretreatment , and add the precision of classing
  针对个人dna数据的隐私保护问题,即:如何保证无法将存储在数据库中的dna序列信息与其提供者的个人身份信息(如:姓名,身份证号码等)联系起来,本文对一种新近开发的隐私保护方法? dnala ( dnalatticeanonymization )进行了改进,在数据预处理阶段,用两两双序列比对代替了原算法中的多序列比对,在不降低处理精度的情况下减少了数据预处理所耗费的时间;用随机爬山法代替了原算法中的贪心策略,增加了算法后期处理的精度,从而形成了一种新的算法? savior 。
• In the design of corpus , we carefully analyze the syllable distribution of corpus th - coss , then classify the prosodic characters of this corpus and present out the distribution of every prosodic character . based on prosodic character vector , we construct an error function which is used to select original corpus for simulation system , and show the distribution of prosodic characters for the original corpus . greedy algorithm and corpus self - adaptive process are expatiated to set theoretical foundation for text material search
  在语料库分析与设计方面,首先统计th - coss语料库中音节分布情况,给出th - coss语料库韵律特征分类,并对每一种韵律特征进行统计,然后构造了一个基于韵律特征向量的误差函数,并采用该误差函数提取语料组成模拟系统的初始语料库,分析该库的韵律特征分布,最后阐述了greedy算法与语料自适应过程,为文本语料的搜索打下理论基础。
• In the leach - new protocol , the mainly improvement of the leach protocol exhibits as follow : for the sake of balancing the network load , the network choose the clusters based on the residual energy ; we take multi - hop communication between sensors instead of single - hop communication , which results in the reduction of energy consumption of clusters ; the new protocol finds the path to the cluster head with the minimum cost , using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link ; the algorithm for assigning tdma time slot reduces overall delays of network
  在leach - new协议中,对leach协议的改进主要体现在以下几个方面:根据节点剩余能量选择簇头,以平衡网络负载;节点间采用多跳路由,降低簇头能量消耗;节点根据能量消耗的代价来选择至簇头的路由,通过扩散算法来广播代价消息,采用贪婪算法来选择能量消耗最小的路径;采用tdma时隙分配算法减少网络时延。最后,利用ns2仿真软件进行验证。
• On the base of implementing greedy algorithm , we put hi - ward an idea of using genetic algorithm into query optimization because of the localization of traditional optimization algorithm while processing multi - join query . moreover , we discuss a series of essential query optimization problems . we also present the test results on the pefformance of optimizer and give the analysis of them
  由于传统查询优化算法在处理多连接查询时在性能或优化结果上得不到好的效果，在实现greedy优化算法的基础上，本文提出将遗传算法应用于查询优化中，从而解决多连接查询的优化问题。
• The numerical examples have shown that the parallel algorithm presented for contact - impact simulation on a pc cluster exhibits good parallel efficiency and scalability . a new modified greedy algorithm is presented in this paper which can obtain better length to width ratio through considering the information of nodes
  提出了一种修正的greedy算法以完成区域自动划分的任务，相对于传统的greedy算法，新算法使得分割子域具有更好的长宽比，且适用于不规则几何形状的有限元网格的区域划分。
• Therefore , the original optimization model is transformed into the problem of cross sectional area optimization . this paper had great research on the development of optimization algorithm by analyzing typical optimal search method , such as greedy algorithm , simulated annealing algorithm , neural network and genetic algorithm ( ga ) . according to the characteristics of truss structure , we choose genetic algorithm as the solution way
  本文在研究优化算法发展过程的基础上，分析了典型的优化搜索方法：确定性算法如贪婪算法，随机搜索算法如模拟退火算法，人工智能算法如神经网络及遗传算法，根据桁架结构优化的特点，最终选择以遗传算法作为桁架结构优化设计的主要算法。