英语翻译最近忙着翻译文章,如果翻译的好,会在能力范围内给大家积分,先试着翻几段吧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 su

英语翻译
最近忙着翻译文章,如果翻译的好,会在能力范围内给大家积分,先试着翻几段吧
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: