1、We advise to optimize its running time of G. 723.1 speech coder.
我們建議對(duì)G . 723.1語(yǔ)音編碼器的編碼時(shí)間進(jìn)行優(yōu)化。

2、Running time of the Oscar telecast: 3 hours, 34 minutes.
奧斯卡電視轉(zhuǎn)播的時(shí)長(zhǎng)：3小時(shí)34分鐘。

3、The algorithm running time is a logarithmic function of the number of linkage axes.
以聯(lián)動(dòng)軸數(shù)作為輸入考察插補(bǔ)速度，算法時(shí)間復(fù)雜度是對(duì)數(shù)階的。

4、Note that the running time for the Levenshtein algorithm is always o.
請(qǐng)注意：Levenshtein算法的運(yùn)行時(shí)間總是O (mn)。

5、Increase your mileage and running time slowly.
慢慢地提高你的哩數(shù)和跑步時(shí)間。

6、The Prediction Model of Dynamic Road Running Time Based on FCE
基于模糊綜合評(píng)判的動(dòng)態(tài)路徑行程時(shí)間預(yù)測(cè)模型

7、The maximum estimated running time for the tutorial is three hours.
對(duì)于本文的最大估計(jì)運(yùn)行時(shí)間為三個(gè)小時(shí)。

8、The result is quadratic running time and memory consumption.
結(jié)果是以平方關(guān)系遞增的運(yùn)行時(shí)間和內(nèi)存消耗。

9、In this thesis, we will use probability theory to analyze the running time of algorithms.
在這篇論文中，我們將會(huì)用機(jī)率的理論來(lái)了解一個(gè)演算法所須要運(yùn)行的時(shí)間。

running time翻譯