路徑約束 的英文怎麼說

中文拼音 [lùjìngyāoshù]
路徑約束 英文
path constraint
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. The capacitated open vehicle routing problem and its tabu search algorithm

    帶裝載能力約束的開放式車輛路徑問題及其禁忌搜索演算法研究
  2. A tabu search algorithm for the capacitated open vehicle routing problem is proposed

    提出了一種用於求解帶裝載能力約束的開放式車輛路徑問題的禁忌搜索演算法。
  3. The article believes, on this " becoming " theory point, the leisure philosophy of confucianists aimes at becoming saint and wisdom, and its character is automomy, so man gets happiness of growing up from it ; the confucianists are based on emotion principles in leisure experiencing, they advocate that people taste the meaning and pleasure of life in this way, which break away from themselves, society and god ; the confucianists take a social leisure mad in leisure organizational system, the confucian and music as a read line to impenetrate the whole social organizational system, and they make the social organizational system become the guarantee system and social environment, from which man can obtain self - fulfillment and experience enjoyment

    認為，在「成為」理論方面，儒家休閑哲學以成聖成賢為目標，以角色履行為途徑，以自主性為特徵；在休閑體驗方面，儒家以情感原則為基礎，提倡從擺脫自身、社會和「天」的約束中體驗生命的意義與人生的快樂；在休閑建制方面，儒家走社會休閑化的道路，禮樂作為一個紅線貫穿在整個社會建制中，使社會建製成為人自我實現、體驗快樂的制度保障和社會環境。
  4. Secondly, over - emphasis on the economic development led to the absence of constitutional constraints of economic activities which brought many social and political problems and forced the ccp to make new amendments of the chinese constitution. finally, progresses reflected in certain articles of the chinese constitution will generate more contractual constraints on the ccp and the state, and as the promisee, whether and to what extents the ccp will put these new articles into effect are becoming a big challenge of its legitimacy

    與此同時，政策性修憲所體現出來的「先發展后規范」的改革路徑，導致了改革是在缺乏既定的憲法性約束，甚至是在違憲的條件下展開的，從而引發了一系列的社會問題，這就進一步推動執政黨和國家以修憲的方式應對新的權利要求。
  5. Unfortunately, the problem of finding multicast routing with qos constrained is a np - complete problem. so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra

    然而研究表明，由於qos組播路由帶有多個qos約束參數，因此qos組播路由問題是一個np完全問題，這使得它與傳統的路由過程不同，難以用經典的最短路徑優先演算法求解。
  6. And then, according to minimum principle, each uav smoothes its own path which the coordination agent selects such that the dynamic constraints are sati sfied and the length is preserved

    通過在協同規劃層調整eta ，尋找到既能滿足時間約束，又能使團隊代價最小，且盡量使單架無人機的個體代價次最小的路徑。
  7. A novel two - phase genetic - annealing algorithm is proposed to solve the vehicle routing problem with time window ( mdvrptw ) and multi - constraint in multiple dispatching centers

    摘要針對多約束條件的多配送中心有時間窗車輛路徑問題，提出了一種二階段遺傳退火演算法。
  8. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  9. The orientation path and residual network were defined, the new maximum flow algorithm in network with both node and edge capacity confined was put forward based on feasible flow decompose theorem and by way of the search in artificial intelligence

    定義了有向路徑和殘量網路的概念，依據可行流分解定理，引入人工智慧中搜索的方法，以鄰接矩陣為網路數據存儲結構，提出條件約束下的網路最大流新演算法。
  10. Another constrained problem is delay and delay variation constrained multicast routing problem. sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented

    第二類是時延和時延差約束的多播路由問題，提出了以最短時延路徑為基礎的一種演算法? ? sp - dvma演算法。
  11. The time complexity is low because only shortest paths connected to relay nodes is compared. simulation results show that fairly good cost performance is achieved. there is trade - off between complexity and performance

    由於比較了通過中轉節點后的最短路徑，因此運算的復雜度大大降低，且通過模擬得到了較好的性能，模擬結果表明sp - dvma演算法是一種低復雜度的時延和時延差約束的多播路由演算法。
  12. The delay and delay variation constrained minimum steiner tree problem is also researched. lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem. low time complexity, low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths

    對于時延和時延差約束的最小steiner樹問題，提出了一種基於最小時延路徑和最小費用路徑的演算法?一lcdvma演算法，由於該演算法比較了通過中轉節點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過模擬得到了較小的網路費用和時延差，因此lcdvma演算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發式演算法。
  13. A fast routing algorithm for delay - constrained low - cost multicast

    約束的多播多路徑算販
  14. By analyzing all sorts of data involved in the drawing of plane arrangement of the contact net, the paper then presents and realizes the sub - systems of drawing data management, which includes setting up the data structure, programming and managing of the data and provides the drawing data for the whole system used for the later drawing, finally by introducing the concerned theories of the parameterized design explains the similarities and differences and their applied scope of all kinds of parameterized technologies, and by associating with the features of the plane arrangement maps of the railway contact net analyzing size restraint of contact net

    它是針對鐵路接觸網平面布置圖的特點來完成選擇區間或站場繪制、圖紙設定、圖型設定、字元高度、圖型坐標點、繪圖基點和圖型數據文件保存路徑的設置以及布置圖的標注欄和明細表尺寸設置；緊接著通過對接觸網平面布置圖的繪圖中所涉及的各種類型數據進行分析，提出並實現繪圖數據管理子系統，它包括建立繪圖系統的數據結構，對數據進行編輯管理，向整個系統提供繪圖數據，供其後的圖形繪制使用；最後通過對參數化設計的相關理論進行介紹，闡述了各種參數化技術的異同點和適用范圍，並結合鐵路接觸網平面布置圖的特點具體分析了接觸網線路的尺寸約束。
  15. The model mpls and the diff - serv integration is a body. through has introduced special function bb in the model, carries on the management and the monitoring to the vpn current capacity and in model foundation, has constructed based on the discrimination service restraint route algorithm, carries on the graduation and the classified management to the vpn current capacity then, this article discussed the mpls vpn way to protect and to restore the mechanism. in view of the vulnerable point which its exists has made the improvement. finally, this article

    模型將mpls與diff - serv集成為一體，通過在模型中引入了一個特殊功能的帶寬代理bb ，對vpn流量進行策略管理和監控。在模型基礎，構建了一個基於區分服務的約束路由演算法，對vpn流量進行分級和分類管理。接著，本文探討了mplsvpn的路徑保護與恢復機制，針對其所存在的脆弱點進行了改進。
  16. The authors established an initial velocity model based on the first break time of the actual data, then realized the forward calculation with the improved shortest path ray tracing algorithm, and applied the improved constrained damped simultaneous iterative reconstruction technique ( cdsirt ) to solve large - scale and sparse equations for inversing the near - surface velocity field

    根據實際地震數據的初至波時間建立初始速度模型；採用改進的最短路徑射線追蹤演算法進行正演；利用改進的約束帶阻尼聯合迭代重建技術（ cdsirt ）求解大型、稀疏的方程組來反演近地表的速度場。
  17. 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

    提出了一種基於路徑的緩沖器插入時延優化演算法，演算法採用高階模型估計連線時延，用基於查表的非線性時延模型估計門延遲.在基於路徑的時延分析基礎上，提出了緩沖器插入的時延優化啟發式演算法.工業測試實例實驗表明，該演算法能夠有效地優化電路時延，滿足時延約束
  18. In the operation space, depending on whether path constraints and motion constraints, we make trajectory planning

    本課題的規劃主要是在操作空間中，依據機器人操作臂運動時有無路徑約束和運動約束的要求來進行規劃的。
  19. Additionally two scalable routing techniques which enhance the scalability of on - demand routing protocols for manets, namely, active link repairing and path - constrained route discovery are presented

    另外，提出了鏈路主動修復技術和路徑約束路由發現技術，可以和隨選路由協議結合，增強協議的可擴展性。
  20. The problem is then fed to a nonlinear programming routine to solve for all parameters. the flight dynamics model with yawing motion of uh - 60a is given, scale factors of state variables and control variables are applied based on the consideration of algorithm convergence. then, the optimization of trajectories is expressed as optimal control problem with a performance index constrained by helicopter performance limits, faa regulation and so on

    首先，建立帶偏航運動的直升機點質量模型，然後對狀態變量和控制變量進行無量綱處理，因為狀態變量和控制變量量值相差較大，這使得優化演算法收斂效果變差，所以需要選擇適當的縮放因子，最後把直升機單臺發動機停車后的飛行軌跡表示成一個最優控制問題，即在考慮直升機性能限制和far規范后，指定一個優化性能指標，選擇合適的路徑約束，然後再解最優控制問題。
分享友人
分享到 Line

分享到臉書