作业帮 > 英语 > 作业

英语翻译最近忙着翻译文章,如果翻译的好,会在能力范围内给大家积分,先试着翻几段吧The heuristic assemb

来源:学生作业帮 编辑:作业帮 分类:英语作业 时间:2024/07/09 04:33:02
英语翻译
最近忙着翻译文章,如果翻译的好,会在能力范围内给大家积分,先试着翻几段吧
The heuristic assemblies the knapsacks through an iterative process where a distribution is generated and evaluated by a variation coefficient passed as a parameter at the beginning of the parallel process.If the group of knapsacks generated achieves a good variation coefficient,the algorithm goes on processing the FCM cluster analysis.Otherwise,the initial average value S is increased.If the S adjusted value surpasses the distribution maximal load,the algorithm goes on processing the FCM cluster analysis.On the contrary,a new distribution is generated,in an attempt to push the loads to a smaller number of processors,trying to free processors that will be reallocated to the evaluation of the bigger loads in order to reduce the overall parallel processing time.The looping ends when the distribution evaluation is considered ok or when the lower limit gets equal to the superior limit.
The heuristic core is based on the well known first fit decreasing algorithm much used to treat the bin packing problem .
The parallel FCM cluster analysis balancing scheme is described by the following sequence:
启发式的背包议会通过一个反复的过程,分配和评价,产生了变异系数作为参数传递开始时的并行处理.如果该集团实现背包产生了良好的变异系数,该算法还处理的FCM聚类分析.否则,
最初的平均值S是增加了.如果标调整值超过了最大负荷分配,该算法还处理的FCM聚类分析.相反,一种新的分配产生,试图推动次
é负荷较少的处理器,试图免费处理器,将重新评价的更大的负荷,以减少整体的并行处理的时间.在循环结束时,分配的评价被认为是确定或下限时获得平等的上级限制.
启发式的核心是基于众所周知的首次下降算法更适合用于治疗装箱问题.
平行的FCM聚类分析平衡计划,所描述的顺序如下:
希望可以帮到你.