heuristic path algorithm 中文意思是什麼

heuristic path algorithm 解釋
啟發式路徑演算法
  • heuristic : n. -s 1. 啟發式教學法,啟發式的藝術[應用]。2. 【計算機】直觀推斷,試探法。adv. -ally
  • path : path(ol )=pathological; pathology n (pl paths )1 (自然踏成的)路;路徑;(馬路邊上的)人行...
  • algorithm : n. 【數學】演算法;規則系統;演段。
  1. Heuristic algorithm for shortest path problem with nonlinear constraints

    非線性約束最短路問題的啟發式演算法
  2. An algorithm of path - based timing optimization by buffer insertion is presented. the algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look - up table for gate delay estimation. and heuristic method of buffer insertion is presented to reduce delay. the algorithm is tested by industral circuit case. experimental results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied

    提出了一種基於路徑的緩沖器插入時延優化演算法,演算法採用高階模型估計連線時延,用基於查表的非線性時延模型估計門延遲.在基於路徑的時延分析基礎上,提出了緩沖器插入的時延優化啟發式演算法.工業測試實例實驗表明,該演算法能夠有效地優化電路時延,滿足時延約束
  3. 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來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同,演算法基於單元行劃分來進行單元的插入和位置調整,在此過程中使對原布局方案的影響最小,並且盡可能優化線長.一組從美國工業界的測試例子表明,該演算法運行速度快,調整后的布局效果好
  4. Generally speaking, there are two approaches to environment modeling : geometrical modeling method and topological modeling method. having valued the advantages and disadvantages, this paper adopts the topological modeling method, and then plans a static collision - free path for every robot by using the heuristic a star algorithm

    在分析和總結以往機器人環境建模方法的基礎上,本文基於拓撲法對環境進行建模,並給出用a *演算法搜索出的機器人靜態無碰路徑。
  5. A heuristic optimization path - finding algorithm based on dijkstra algorithm

    演算法的啟發式最優路徑搜索演算法
  6. For video images with moving objects, an optimal stitching line was found by heuristic optimal path search algorithm in mosaics of images, and the images were smoothed by multi resolution theory after mosaics of images

    對存在運動物體的視頻圖像,採用啟發式最優路徑搜索演算法尋找到圖像間拼接的最佳縫合線,並使用多解析度原理進行圖像拼接后的平滑處理。
  7. Then the result of certain k - shortest path algorithm is introduced as a set to be chosen by both the simulated anneal algorithm and heuristic algorithm, concerning the end - to - end traffic requirement and restriction on link bandwidth. afterwards, the effect of the value k on the outcome of the simulated anneal algorithm is researched. the network resource is allocated, while the study of link protection problem on traffic routing is introduced and two types of protection, shared protection and dedicated

    首先考察實際的網路模型,根據業務需求,引入k路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合,在鏈路帶寬有限的約束下對網路資源進行分配,同時引入業務路由的通路保護問題的研究,實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路,根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化,研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的
  8. At last, we study on robot path planning for an approach to find out a perfect path in a certain map using a heuristic search algorithm

    本文最後,還對移動機器人路徑規劃進行了研究,使用啟發式搜索演算法在給出的地圖信息空間中尋找理想的路徑。
分享友人