最大团的英文

• clique

• "最大"英文翻译    maximum
• "团"英文翻译    dumpling
• "大团" 英文翻译 :    agglomerate; datuan
• "大团结" 英文翻译 :    great unity
• "大团块" 英文翻译 :    large crumb; megalump
• "大团圆" 英文翻译 :    1.(全家人聚一起) happy reunion2.(团聚的结局) happy ending
• "一大团" 英文翻译 :    piles of
• "百慕大团" 英文翻译 :    bermuda regiment
• "大团结报" 英文翻译 :    dai doan ket
• "大团聚体" 英文翻译 :    macro aggregate; macroaggregate
• "大团粒土" 英文翻译 :    buckshot soil
• "大团囊虫草" 英文翻译 :    cordyceps ophioglossoides
• "大团囊菌科" 英文翻译 :    elaphomycetaceae
• "大团囊菌属" 英文翻译 :    elaphomyces
• "大团圆结局" 英文翻译 :    a ha y ending; a happy ending; happy endings
• "大团圆结尾" 英文翻译 :    happy ending
• "家庭大团圆" 英文翻译 :    family reunion
• "巨大团块" 英文翻译 :    huge mass
• "民族大团结" 英文翻译 :    great national union
• "欧洲大团圆" 英文翻译 :    european reunion
• "鹿色大团囊菌" 英文翻译 :    aphrodisiac fungus
• "骑士团大团长" 英文翻译 :    grand master
• "有大团圆结局" 英文翻译 :    have happy ends
• "最大" 英文翻译 :    maximum◇最大读数 full-scale reading; 最大负载 maximum load; peak load; 最大概率 maximum probability; 最大功率 maximum power; peak-power; ultimate output; 最大公约数 greatest common divisor; greatest common measure; maximal common divisor; 最大宽度 maximum width; 最大流量 maximum stream flow; maximum discharge; 最大坡度 ruling grade; maximum gradient; 最大射程 extreme range; 最大误差 maximum error; 最大限度 high limit; maximum limit; 最大值 maximum; maximum value; maximal value; summit; spike; apex; greatest value
• "闭幕；(事件的)结尾，大团圆。" 英文翻译 :    curtain fall

• The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard , and many practical problems can be formulated to it . therefore , studying the mcp is full of significance both in theory and in practice
  最大团问题是一个经典的np难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。
• Firstly the outline of metaheuristics for mcp is shown and a description of mcp is given . then tow similar metaheuristics for mcp are introduced : ea / g , the best genetic algorithm found so far , and the existing simple aco algorithm
  接着,对解决最大团问题现存的简单的蚁群优化算法进行分析,指出它存在的不足,从而在此基础上提出一个改进的蚁群优化算法,并对该算法的intensification和diversification机制进行了分析。
• This paper is devoted to investigating the capability of aco metaheuristic for solving mcp and proposes an intensification - diversification balanced aco algorithm for mcp . moreover , the algorithm is applied to improving the progressive algorithm which is for multiple sequences alignment problem ( msa )
  鉴于此,本文对蚁群优化算法解决最大团问题的能力进行了研究,提出一个解决最大团问题的intensification和diversification平衡协作的蚁群优化算法。
• The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper . based on these existing algorithms , we present a new branch and bound algorithm for the maximum weight clique problem
  本文首先对当前国际上最大团问题的理论研究成果及算法研究中的启发式算法进行了介绍，然后对精确算法中的分支定界法作了较为详细的讨论，最后作者在现有算法的基础上，给出了最大加权团问题的一种新的分支定界算法。
• Finally , the ability of applying the approved aco algorithm to msa is studied . the idea of divide - and - conquer is adopted to improving the progressive algorithm and the longest common subsequence of multiple sequences is proposed as the partition points of multiple sequences . also , the paper presents how to solve the longest common subsequence of multiple sequences by the approved aco algorithm for mcp
  最后,本文对改进的蚁群优化算法在多序列比对问题上的应用进行了研究,采取分治思想改进现有的progressive算法,提出利用最长公共子序列进行多序列分割的策略,并给出怎样利用解决最大团问题的蚁群优化算法求解多序列的最长公共子序列的方法。
• Then the paper analyzes the shortcomings of simple aco and proposes an approved aco algorithm , and then analyzes the intensification - diversification schemes of it . moreover experiments on dimacs benchmarks are run and the results show that the approved aco algorithm not only outperforms the simple aco algorithm , but also outperforms ea / g algorithm , the best genetic algorithm for mcp found so far
  此外还利用dimacs提供的最大团问题的基准实例,对改进的蚁群优化算法的性能进行了测试,实验结果表明,该算法的性能不仅超过了简单的蚁群优化算法,还超过了与其机制类似的迄今为止性能最好的遗传算法? ea / g算法。