With an instance, it has proved that the upper bounds of the performance ratio of the aggregation algorithm are achievable for the MAFS scheduling problem.

 
  • 用一實(shí)例證明,MAFS排序問(wèn)題的歸并算法的性能比是上界可達的。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan