placement algorithm 中文意思是什麼

placement algorithm 解釋
布局演算法
  • placement : n. 1. 放,安置。2. 找職業。3. 定職位,安排。4. 【足球】定位;定位踢的球位;定位踢(=placekick)。
  • algorithm : n. 【數學】演算法;規則系統;演段。
  1. The development of basic functional models for computing, designing, editing and intercommunicating, such as the layout algorithm, the design and placement of dead block, and adding and deleting of heat tubes

    完成了系統必要的設計、編輯和交互功能,包括:折流板的設計與放置,連續增添及刪除換熱管、拉桿等。
  2. A placement algorithm of web proxy in the internet

    網路中代理服務器最優放置演算法
  3. The optimal placement of electronic components based on ant algorithm

    基於螞蟻演算法的電子元器件位置優化
  4. Abstract : a new clock - driven eco placement algorithm is presented for standard - cell layout design based on the table - lookup delay model. it considers useful clock skew information in the placement stage. it also modifies the positions of cells locally to make better preparation for the clock routing. experimental results show that with little influence to other circuit performance, the algorithm can improve permissible skew range distribution evidently

    文摘:提出了一種新的時鐘性能驅動的增量式布局演算法,它針對目前工業界較為流行的標準單元布局,應用查找表模型來計算延遲.由於在布局階段較早地考慮到時鐘信息,可以通過調整單元位置,更有利於后續的有用偏差時鐘布線和偏差優化問題.來自於工業界的測試用例結果表明,該演算法可以有效地改善合理偏差范圍的分佈,而對電路的其它性能影響很小
  5. Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design. due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement. novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps. moreover, divide - and - conquer strategy and other simplified methods are adopted to minimize complexity. experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time

    文摘:以大規模混合模式布局問題為背景,提出了有效的初始詳細布局演算法.在大規模混合模式布局問題中,由於受到計算復雜性的限制,有效的初始布局演算法顯得非常重要.該演算法採用網路流方法來滿足行容量約束,採用線性布局策略解決單元重疊問題.同時,為解決大規模設計問題,整體上採用分治策略和簡化策略,有效地控制問題的規模,以時間開銷的少量增加換取線長的明顯改善.實驗結果表明該演算法能夠取得比較好的效果,平均比paflo演算法有16的線長改善,而cpu計算時間只有少量增加
  6. The basis is hierarchical placement based on the model of directed graph partition. introducing timing - driven placement to clustering, it is an excellent method that mixes the characteristics of timing - driven placement, clustering and directed graph partition. integrated with cdp, this algorithm can solve the system - level vfg problems of electronic devices

    該演算法是基於有向圖分解模型的分級布局演算法,將定時驅動布局思想引入結群過程,是集定時驅動布局、基於結群的布局、基於劃分的布局和有向圖分解思想為一體的快速布局演算法。
  7. For perfecting the placement techniques, the return and preparative processes of the robot ’ s arm are designed and the algorithm attaining their control information is realized by program. the question on how to rotate the core model is studied and the relevant method is put forward

    從完善鋪絲工藝的角度出發,對鋪絲過程中的空程以及鋪絲的準備過程進行了設計,並通過編程實現了空程和準備過程的鋪絲控制信息求解演算法。
  8. This paper presents a novel model and algorithm of rapid system level placement for cdp

    本文提出了一種新的面向系統級并行設計規劃的快速布局模型與演算法。
  9. Illustrated by a tensile composite plate with an open hole and a pin - loaded hole, fiber placement path planning of the fully - steered ply is studied. the optimization of fiber placement paths for composite plate - parts is studied, two kinds of algorithm are brought out to meet different requirements of base - line - path

    3 .將層合板的加強層纖維鋪放路徑優化方法推廣應用於曲面板類復合材料構件的纖維鋪放軌跡規劃,並根據不同基準鋪放路徑數目提出了兩種纖維鋪放軌跡密化演算法。
  10. Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically. this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do. an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength. test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed

    文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同,演算法基於單元行劃分來進行單元的插入和位置調整,在此過程中使對原布局方案的影響最小,並且盡可能優化線長.一組從美國工業界的測試例子表明,該演算法運行速度快,調整后的布局效果好
  11. The optimization of fiber placement paths for composite around - parts is studied, and a triangle algorithm is presented which is easy to implement and can be used for the path generation of free form surface - parts. tow width control and shaping error control are also studied

    4 .提出了用於封閉殼體構件的纖維鋪放軌跡規劃的三角形法,具有通用性強、計算簡便的特點;並討論了纖維鋪放的成形精度與絲寬控制方法。
  12. The paper mainly expounds the principle of automatic name placement of area element by center array method, the algorithm of polygon pretreatment, the method of getting array rotating center and the algorithm of name placement positioning line

    摘要本文闡述了中心陣列法進行面狀要素自動注記的原理、多邊形預處理演算法、求取陣列旋轉中心的方法和求取注記定位線的演算法。
  13. ( 2 ) an algorithm of dual - rate predictive control based on the pole placement is proposed

    ( 2 )研究了基於極點配置的雙速率采樣預測控制演算法
  14. A novel method of content - based image segmentation using deformable template matching is proposed. a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly. then the definitions of internal and external energy functions are given according to the image segmentation problem, and genetic algorithm is used to obtain globally optimal solutions. the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template. experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method

    本文提出一種採用可變形模板匹配技術進行基於內容的圖像分割演算法.通過預先計算出可變形模板沿著變形的正交曲線,並對模板曲線及正交曲線進行離散抽樣,建立一基於正交曲線的二維( 2 - d )可變形模板,針對圖像分割問題定義控制可變形模板進行變形的內、外部能量函數,本文採用遺傳演算法搜索能量函數最小的全局最優解.該新演算法比傳統的可變形模板匹配方法降低了搜索空間的維數,減少了演算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結果表明,新演算法具有良好的分割精度及穩定性
  15. Based on this background and by the support of the project " the application of the computational intelligence in vlsi physical design " from sichuan science and technology bureau foundation, this dissertation is intended to develop a tabu search algorithm based on computational intelligence methodology for the placement of vlsi physical design

    由此,基於四川省科技廳基金項目? ? 《計算智能在超大規模集成電路物理設計中的應用》 ,本文對計算智能演算法中的禁忌搜索演算法在vlsi電路晶元布局設計中的應用進行了一些研究。
  16. ( 2 ) an algorithm of tows number calculation is proposed. according to the distance between the points on the path and the nearby fiber placement path, the tows number is calculated on each point

    首先等距相鄰的鋪絲路徑,然後依據當前鋪絲路徑上各點與等距線的距離關系,求得該鋪絲路徑上各點處的絲數信息。
  17. The nonrecursive algorithm is proved to terminate in finite steps and turn out to be a constant vector too. because two modifications estimated models are asymptotically uniformly nonsingular, thus the possible singularity in the adaptive pole placement systems is completely avoided. however the prior knowledge required is only the observability indices of systems, thus, the required prior knowledge is greatly reduced

    非迭代的修正策略證明了參數修正向量在有限步內收斂於一個常向量;上述兩種修正策略均保證了估計模型的一致能控性,從而徹底解決了自適應極點配中可能出現的奇異性問題,而所需的先驗知識僅為系統的能觀性指數。
  18. A deterministic vlsi block placement algorithm using less value first principles

    一種基於最小價值度優先的集成電路布圖規劃和布局演算法
  19. In this dissertation, adaptive pole placement algorithm for multivariable system with a general uncertain structure is analyzed, and two kinds of modification strategies for parameter estimation are synthesized and compared. the further improved orientation so as to cancel the necessary condition of controllability of parameter estimation is pointed out

    本文針對具有一般不確定結構的多變量系統分析了基於能控性的自適應極點配置演算法,綜合比較了該演算法給出的兩種估計參數的修正策略,提出了去掉系統能控性假設的途徑。
  20. Efficient algorithms are proposed to build standard views or section views. and an automatic view placement algorithm is presented in this paper. this paper presents an intelligent dimensioning approach to generate dimensions for 2d drawing automatically for 3d models based on feature extraction

    該策略的基本思路為:通過對於三維尺寸冗餘和三維尺寸特徵的識別,自動生成一個三維尺寸組;然後將這些三維尺寸映射成為二維尺寸並進行布局,由此完成尺寸的自動生成。
分享友人