approximation algorithm 中文意思是什麼

approximation algorithm 解釋
近似演算法
  • approximation : n. 1. 接近；近似。2. 【數學】近似值。3. 概算，略計。
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Iterative approximation algorithm of hessian matrix in structural optimization

    結構優化中的海森矩陣的近似迭代方法
  2. A new learning algorithm of the continue wavelet networks parameters is proposed, that is, hybrid parameters learning algorithm. the parameters of wavelet networks are divided into two parts, and different methods are used to training them. compare to the traditional parameters learning method, the new method proposed in this paper has the advantages of rapid convergence speed and high approximation capability

    提出了連續小波網路的混和參數訓練方法，將小波網路參數分為小波系數和網路權值兩部分，對這兩部分參數分別採用不同的方法進行訓練，這一新的訓練方法相對于傳統的小波網路參數訓練方法來說具有收斂速度快，逼近精度高等優點。
  3. Approximation algorithm for the total tardiness scheduling with precedence constraints

    帶有前後約束的延誤排序問題的近似演算法
  4. Approximation algorithm of misclassification minimization

    錯誤分離最小化的一個新的近似演算法
  5. Randomized approximation algorithm for weighted set cover problem

    帶權集合覆蓋問題的一種隨機近似演算法
  6. A smoothing approximation algorithm for nonlinear complementar ity problems

    求解非線性互補問題的一個光滑逼近演算法
  7. The complexity and approximation algorithm of three parallel machines scheduling problem with servers

    帶服務器的三臺平行機排序問題的復雜性和近似演算法
  8. An approximation algorithm for min - max tree partitioning and an optimal algorithm for min - sum tree partitioning

    最小最大樹劃分的近似演算法與最小和樹劃分的精確演算法
  9. Secondly, based on nurbs curves approximation algorithm, a nurbs surface approximation algorithm on discrete data sets is given. thirdly, a shape - preserving parametric surface interpolation to data set is given

    2基於所給的nurbs曲線的逼近演算法，建立了帶插值條件的離散點集的nurbs曲面的逼近演算法。
  10. The nurbs curves and surfaces approximation to constrained data sets is discussed in this dissertation. the major works are as follows : firstly, based on simulated annealing algorithm and least square principle, a nurbs curves approximation algorithm to constrained discrete data sets is presented

    本文討論了帶約束的離散點集的nurbs曲線、曲面的逼近問題，主要工作如下： 1基於模擬退火演算法和最小二乘法，給出了帶插值條件的離散點集的nurbs曲線逼近的演算法。
  11. Based on many references, a evaluating function is proposed with performance index of hall call waiting time ( hwt ), people number in a car, energy consuming. the statistic approximation algorithm for hwt is introduced, based on the analysis of elevator traffic state, the calculation of traveling distance and stop number is explained in detail in the thesis. according to the characteristics of the elevator, a group of elevator teaching signals are constructed, by which the weight coefficients are trained according to the widrow - hoff rule

    本文在借鑒了大量的文獻基礎上，提出以平均等候時間、轎廂人數、能源消耗為性能指標的評價函數；詳細介紹了乘客待梯時間hwt的統計近似演算法；基於對電梯交通狀況的分析，對停層次數和運行距離這兩個重要參數的計算進行了詳盡的介紹；依據電梯運行特性參數，構造一組電梯運行教師信號，並採用神經網路的widrow - hoff學習規則訓練權系數。
  12. The parametric speed of the curve is firstly approximated by the bezier polynomial which takes the lengths of control polygon ' s edges of the direction curve of normal as bezier coordinates. then the corresponding geometric offset approximation algorithm is given. moreover, an offset approximation with high precision is obtained by degree elevation of the direction curve of normal

    首先利用以法矢方向曲線的控制多邊形邊長為b zier縱標的b zier多項式來逼近曲線的參數速度，給出了相應的幾何等距逼近演算法，進一步結合法矢方向曲線的升階獲得了高精度逼近
  13. This process is as follows : firstly, the data of different section contour and of section line have been obtained by reverse - engineering ; secondly, non - uniform b - spline approximation algorithm is used to fit the discrete data ; then the data have been optimized and reduced by adopting adaptive sampling of key points of the fitted curve based on vertical distance, sequently the adaptive sampling data is transformed into the format of the. ibl file of the famous 3 - d design software pro / e. therefore we reconstruct the surface and a model is generated ; lastly, the effectiveness of the adopted algorithm and modeling approach are demonstrated by the experiments

    建模型的過程中，首先運用逆向工程測量方法，獲得曲面物體上不同截面輪廓線的測量數據點列，接著對測量數據點進行平滑處理，用最小二乘法求解基於數據點列的控制多邊形，以非均勻三次b樣條曲線擬合截面輪廓曲線；然後利用基於垂距的數據采樣演算法，對擬合曲線上的數據點進行重新采樣，達到優化數據點的分佈及減少描述曲線數據量的目的。
  14. 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 ）的基礎之上，提出了一種輻射傳輸四流近似計算方法，並且該演算法可以得到一個解析解。
  15. In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems, one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio, another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan, we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1. 6

    第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。
  16. 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

    由於該問題的難度較大，近年來許多學者致力於研究其多項式可解的情形及上下界的確定。遺憾的是，到目前為止，仍未發現有效演算法。
  17. 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

    摘要把工件之間不帶前後約束的延誤排序的后移演算法移植到帶有前後約束的情況，提出一個多項式時間的近似演算法。
  18. An approximation algorithm a2 - 1 with absolute performance ratio 3 / 4 is proposed and the asymptotic performance ratio of a2 - 1 applied to the problem in which machines require prepare times is 2 / 3. another problem is two parallel machines scheduling to maximize the number of just in time jobs. for this problem we give a polynomial time optional algorithm in the case early penalty is larger or equal to late penalty, and it is proofed to be np - had when early penalty is less than late penalty

    第二章所討論的另一個問題是帶提前和延誤懲罰的兩臺機排序極大化justintime完工工件數問題，當提前懲罰大於或等於延誤懲罰時，本文提出了該問題的一個多項式時間最優演算法a _ （ 2 - 2 ） ，從而證明了該問題是一個p問題，當提前懲罰小於延誤懲罰時，我們證明了該問題是一個np難的問題。
  19. A successive approximation algorithm of designing optimal disturbances rejection controllers is developed with respect to quadratic performance indexes

    關於二次型性能指標給出了一種設計最優擾動抑制控制律的逐次逼近方法。
  20. 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 ，該演算法的最壞情況界和時間復雜性優于除近似方案以外的已有近似演算法。
分享友人
分享到 Line

分享到臉書