×

greedy algorithm中文什么意思

发音:   用"greedy algorithm"造句
  • 式演算法
  • 贪婪算法
  • 贪婪演算法
  • 贪心法
  • 贪心算法
  • 饕餮法
  • 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.
  • as greedy as a wolf:    贪婪如狼
  • be greedy for money:    棺材里伸手-死要钱
下载手机词典可随时随地查词查翻译

例句与用法

    更多例句:  上一页    下一页
  1. 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是一种象素级的轮廓搜索算法,它在方向图中找到开始点和目标点之间的最小代价路径。
  2. 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
    对空间覆盖率优先问题,分别应用遗传算法及贪婪算法对其实现了近似求解,并通过对这两种不同求解算法的特点及复杂性进行分析,明确了这两种算法的适用条件;随机实验也进一步说明了两种算法的优缺点所在。
  3. 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 。
  4. 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算法与语料自适应过程,为文本语料的搜索打下理论基础。
  5. 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仿真软件进行验证。

相关词汇

其他语言

相邻词汇

  1. greedily 什么意思
  2. greediness 什么意思
  3. greedinessrapacity 什么意思
  4. greedo 什么意思
  5. greedy 什么意思
  6. greedy algorithms 什么意思
  7. greedy and mean 什么意思
  8. greedy as a pig; wolfish greed 什么意思
  9. greedy eyes 什么意思
  10. greedy folks have long arms 什么意思
桌面版繁體版English

相关阅读

Copyright © 2025 WordTech Co.

Last modified time:Tue, 19 Aug 2025 00:29:56 GMT