approximate construction 中文意思是什麼

approximate construction 解釋
近似結構
  • approximate : vt 1 使接近。2 接近；走近。3 近似，約計。4 模擬。5 估計。vi 近於。 His income this year approxima...
  • construction : n 1 建築，結構，構造，架設，鋪設；建設；設計；工程；建築法，構造法，建築物；【戲劇】搭置，布景，...
  1. Thirdly, from the idea of locally linear approximate, another tangent - plane algorithm is presented for the distance between the convex nurbs surfaces. the critical step is the construction of the support mapping by gjk and lc to search for nearest points, and emphases are laid on dealing with isotropic cases and choosing initial iterated points. it is also proved that no isotropism during iteration would take place if initial iterated points are positive points

    切平面法是運用gjk和lc構造支撐映射的原理而設計的一個搜索近點對的迭代法，著重給出了迷向情況的處理和初始迭代點的選取方法，並證明了只要將初始迭代點取為陽點，就不會出現迷向情況。
  2. Construction and application of approximate developable surfaces

    近似可展曲面的構造及應用
  3. Firstly a routing problem among transistor groups is brought forward. by analyzing the property of optimized rectangle steiner tree, an algorithm of approximate rectangle steiner tree construction is proposed. according to the mutual exclusion relationship among the net ports in the dvcs, the strategy for choosing connection ports is advanced

    論文首先提出了晶體管群之間的線網布線問題，通過分析優化矩形斯坦納樹的性質，提出了一種符合宏單元布局特徵的近似矩形斯坦納樹構造演算法，同時針對晶體管群dvc內引線端點間走線互斥關系，提出斯坦納樹可選端點篩選策略。
  4. To obtain the fast matrix - vector multiplication algorithm, we approximate the kernel function with piece - wise polynomial and get the approximate coefficient matrix a using the approximate kernel function. let n be the number of quadrature points and k2 be the number of interpolating knots at each subdomain. it is proved that the construction of a and the matrix - vector multiplication ax require o ( nk ) operations respectively

    我們利用對核函數進行分片多項式插值逼近得到適用於快速方法的近似系數矩陣a ：矩陣a的計算和矩陣-向量相乘ax各需要o （ nk ）次運算，存貯a需要佔用o （ nk ）內存，其中n為積分節點的個數， k ~ 2為每個小區域的插值節點數。
  5. The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on. based on the solution construction graph, the unified framework of the aco algorithm is presented. an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed, that will converge to the optimal solutions with probability one, then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling

    基於解空間參數化概率分佈模型，首先提出了一個以概率1收斂于最優解的解空間概率分佈的迭代更新過程，然後提出了通過最小化不同分佈間的交互熵距離以及蒙特卡洛采樣來逼近此迭代過程的最小交互熵信息素更新規則，接著分別給出了弧模式以及結點模式信息素分佈模型下的最小交互熵等式。
分享友人
分享到 Line

分享到臉書