算法执行时间 meaning in Chinese

algorithm execution time

The simulated experiment indicates that stbmr ’ s tree ’ cost is up to 4 % more than kpp , while average running time is 54 % less than it
实验表明, stbmr算法构造的组播树费用比kpp算法构造的约大4 % ,算法执行时间比kpp算法约少54 % 。
Besides , of the several algorithms those have been proposed in the literature for solving the transportation problem , previous computational results indicated that the primal algorithm ( modi method ) is more efficient , so we have compared the amedv versus the modi method . because very little experimentation was carried out on algorithmic techniques used in the codes of amedv , we have also performed a number of runs that test the overall solution time as the number of significant digits in each of the parameters is varied
因为元素判别值分配法是运输问题引发出的求解新方法，并且阶石法是目前解运输问题的较快速解法，所以特别针对运输问题通过若干组有代表性的检验数据进行数值测试，在实际问题中对比元素判别值分配法与阶石法的算法执行时间，研究两对算法执行效率上的差别，并分析差别产生的原因。