約束滿足 的英文怎麼說

中文拼音 [yāoshùmǎnzú]
約束滿足 英文
constraint satisfaction
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 滿 : Ⅰ形容詞1 （全部充實; 達到容量的極點） full; filled; packed 2 （滿足） satisfied; contented; conte...
  • 足 : Ⅰ名詞1 （腳; 腿） foot; leg 2 （姓氏） a surname Ⅱ形容詞（充足; 足夠） sufficient; ample; enough;...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  • 滿足 : 1. （感覺足夠） satisfied; content; contented 2. （使滿足） satisfy; fulfil; wreak; meet
  1. On the basis of analyzing limitation of using penalty function method dealing with constraints, an amending method based on the knowlege regulating strategy is suggested to amende the mapping relationship of infeasible constraints in decoding, thus making the regulated individuals map into the space to obtain the most promising optimal solution

    在分析懲罰函數法對約束處理效率較低的情況下，提出了一種基於知識調整策略的修正法，對解碼中不滿足約束的映射關系進行修正，使調整后個體映射到最有希望獲得最優解的空間中。
  2. A concession contract can be regarded as a payoff contract under the framework of principal - agent theory. it needs to meet the participation constraint and incentive compatibility constraint of concessionaire. the payoff designing can be analyzed by the backward - induction method

    特許權合約可以看作一個委託代理框架下的報酬合約，需要滿足特許權人的參與約束和激勵相容約束條件，報酬設計可以使用逆序遞推的方法分析。
  3. In the entitative routing stage, the macro - cell layout must be compressed for optimization area and time delay. it should be compared beauty with the routing result by manual. an algorithm, which is gridless, variable widths and minimizing layer permutation, is advanced for channel region

    晶體管級實體布線階段，由於庫單元的復用性，要求庫單元版圖緊湊，即要求單元版圖在滿足各約束條件的前提下面積、性能優化程度較高，能與手工設計的版圖相媲美。
  4. Buyers ( management ) can get profit from the raising of companies performance and the underestimated prices, avoid hostility acquisition, satisfy the needs of carving out business ; seller ( shareholder ) can reach the purpose of reducing agency cost, incent and restrict the management, peel off assets and change public - owned departments to private departments

    買方管理層可以獲得來自公司經營業績的提高和企業價值被低估的收益，避免被敵意收購，滿足創業的需要；賣方股東可以達到降低代理成本、激勵和約束管理層、剝離資產和公營部門私有化的目的。
  5. On the premise of a given set of material parameter, structural boundary shape and condition, design variables - thickness of plate and shell, is designed to minimize the structural weight subjected to the constraint conditions. 1. for the problem with size and stress constraints, full stress design method is used to solve the sectional optimization of plate and shell structures

    在給定了板殼的材料常數、板殼結構的邊界形狀和邊界條件的前提下，確定表徵板殼厚度的設計變量，在滿足約束條件下實現結構重量最小： 1 .對于尺寸和應力約束的問題，使用滿應力方法求解。
  6. The centrosymmetric structural dynamical systems with damping were studied. the nearest triple matrix of the centrosymmetric with satisfying characteristic equations was found to a given triple matrix ( mass 、 stiffness and damping matrices ). finally, numerical examples were given

    3 .研究了阻尼中心對稱結構動力模型修正問題，對給定的三重矩陣（質量矩陣、剛度矩陣和阻尼矩陣） ，求滿足譜約束條件且具有中心對稱特性的「最接近」的三重矩陣，並給出數值算例。
  7. 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 ，尋找到既能滿足時間約束，又能使團隊代價最小，且盡量使單架無人機的個體代價次最小的路徑。
  8. And of all scheduling problems, the job - shop scheduling problem ( jsp ) is most common and complicate, which is usually a typical np - complete problem

    本文主要介紹了約束滿足神經網路（ csnn ）在作業車間調度問題（ jsp ）中的應用。
  9. The intelligent fixing test paper is a process of the problem of constraint satisfaction based on a typical relational database

    摘要智能組卷是一個典型的基於關系數據庫多約束滿足的問題求解過程。
  10. Efficient sequential pattern mining algorithm based on average value constraint satisfaction pruning strategy

    基於均值約束滿足度剪枝策略的高效序列模式挖掘演算法
  11. An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising

    提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果
  12. Abstract : an algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising

    文摘:提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果
  13. Study on university courses arrangement based on constraint satisfaction

    基於約束滿足的高校排課問題研究
  14. Development of web service dynamic statistic graphics based on component technology

    的約束滿足優化技術研究
  15. As with other engineering design, die design is, by its nature, a constraint satisfaction problem, how to tailor design space in accordance with constraints

    冷沖模設計同其它工程設計一樣，本質上是一個約束滿足問題，其實質就是多個約束條件裁減設計空間。
  16. Comprehensively considered the characters of scheduling problem in iron and steel enterprise, a steelmaking - casting - rolling integral scheduling method based on csp was designed by means of object - oriented design pattern

    摘要綜合考慮鋼鐵企業調度問題的特點，利用面向對象的設計模式，提出了基於約束滿足方法的冶、鑄、軋一體化生產調度方法。
  17. For this reason, the thesis presents an approach based on constraint satisfaction, symbolic execution and extended finite state machines. it can analyze programs written in a subset of the c programming language

    針對上述情況，本文中提出了一種方法，它基於約束滿足問題求解方法和擴展有限狀態機上的符號執行演算法，能夠對c語言子集描述的程序進行分析。
  18. I regard qsim as a kind of constraint satisfaction problem ( csp ), and improve the qualitative simulation algorithm by constraint logic programming ( clp ). fuzzy qualitative simulation develops conventional qsim on several facets, such as representation of qualitative value, state transition rule and filtering algorithms. it bridges the gap between pure qualitative and quantitative, and improve the efficien

    前者是將定性模擬演算法看作一類約束滿足問題，用約束邏輯程序加以改進，不僅為解決定性模擬問題提供了邏輯框架，而且也是一種規范化的程序描述語言；模糊定性模擬演算法則是對純定性模擬演算法在知識描述、狀態轉移規則、過濾演算法等方面的改進，是一類半定量描述方法，有利於在定性模擬領域綜合定量信息，同時提高演算法的效率。
  19. Pretreatment is used to generate alternate activities to achieve the requirements. theproblem after pretreatment is characterized as a constraint satisfaction problem, which is solvedby the local search algorithm based on dynamic priority. the solution means to specifycorrespondingactivitiesforeveryrequirementandtoallocateexecutingtimeandresources. in order to validate the modeling framework presented in this paper, a software system isdesigned to implement the mission planning and scheduling for msrs

    預處理過程自動生成完成任務需求的候選活動集;預處理之後的問題被描述為一個約束滿足問題，通過基於動態優先級的局部鄰域搜索演算法完成問題的求解，即為每個需求指定相應的活動，並為這些活動安排執行時間並指派資源。
  20. To explain how to use the heuristics information of the problem to construct constraint - based solving algorithm, the general constraint satisfaction solving technology was briefly introduced, then the principles and the applicability of constraint propagation algorithm, tree search algorithm and heuristics repair algorithm for job shop scheduling were summarized

    摘要為了說明如何利用啟發式信息構造車間調度的約束滿足求解演算法，首先概述了常規約束滿足求解技術，進而介紹了車間調度問題的約束傳播演算法、樹搜索演算法和啟發式修復演算法的構造原理及適用性。
分享友人
分享到 Line

分享到臉書