无码国产精品一区二区免费16,夫妇交换做爰4,97SE亚洲精品一区,小说区图片区色综合区

approximation algorithm中文什么意思

發音:

用"approximation algorithm"造句

近似算法

approximation: n. 1.接近；近似。 2.【數學】近似值。 3.概算， ...
algorithm: n. 【數學】算法；規則系統；演段。
successive approximation algorithm: 逐次逼近算法
approximation: n. 1.接近；近似。 2.【數學】近似值。 3.概算，略計。 successive approximations 逐次近似計算法。 be a very close approximation to 很接近于…。
approximation approximation: 近似，逼近

下載手機詞典可隨時隨地查詞查翻譯

例句與用法

Up to now , most of the known upper bounds are asymptotic , and there is no polynomial approximation algorithm except , cor planar graphs which have a 2 - approximation algorithm
由于該問題的難度較大，近年來許多學者致力于研究其多項式可解的情形及上下界的確定。遺憾的是，到目前為止，仍未發現有效算法。
For the total tardiness scheduling with precedence constraints , an approximation algorithm with polynomial complexity was presented by transplanting the backward - shift algorithm of the case without precedence constraints
摘要把工件之間不帶前后約束的延誤排序的后移算法移植到帶有前后約束的情況，提出一個多項式時間的近似算法。
We prove that the worst - case ratio of algorithm d is 15 / 13 , which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity
我們證明了對三臺機情形，算法d的最壞情況界為15 13 ，該算法的最壞情況界和時間復雜性優于除近似方案以外的已有近似算法。
It is important to find a precise and fast algorithm for solar radiative transfer in the atmosphere . in this paper , we present , based on stamnes " s discrete - ordinate - method , an analytical four - stream approximation algorithm
我們在knutstamnes的離散縱標法( 1988 )的基礎之上，提出了一種輻射傳輸四流近似計算方法，并且該算法可以得到一個解析解。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我們分別研究了四個組合優化問題的近似算法，并給出了它們的性能分析。

In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP-hard problems; since it is unlikely that there can ever be efficient polynomial-time exact algorithms solving NP-hard problems, one settles for polynomial-time sub-optimal solutions.

詳細百科解釋