狀態空間搜索 的英文怎麼說

中文拼音 [zhuàngtàikōngjiānsōusuǒ]
狀態空間搜索 英文
state space search
  • 狀 : Ⅰ名詞1 （形狀） form; shape 2 （情況） state; condition; situation; circumstances 3 （陳述事件或...
  • 態 : 名詞1. （形狀; 狀態） form; condition; appearance 2. [物理學] （物質結構的狀態或階段） state 3. [語言學] （一種語法范疇） voice
  • 空 : 空Ⅰ形容詞（不包含什麼; 裏面沒有東西或沒有內容; 不切實際的） empty; hollow; void Ⅱ名詞1 （天空） s...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 狀態 : status; state; condition; state of affairs: （病的）危險狀態 critical condition; 戰爭狀態 state o...
  • 空間 : space; enclosure; room; blank; interspace
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. The application of sa and heuristic algorithm in packing problem is studied deeply. an improved sa, which utilizes heuristic approach in search tragedy and movement tragedy, is introduced and manifested to enhance the rate of convergence with an extent of exact solution

    對sa演算法和啟發式演算法在布局問題中的應用進行了研究，為提高收斂速度同時保證一定精確度，對sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，縮小布局狀態空間的搜索。
  2. Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm, the present of the general searching algorithm is the apparent progress for the searching technology

    因為組合問題的狀態空間表示比原來的搜索求解容易的多，通用搜索演算法的提出是搜索技術的一個明顯的進步。
  3. Searching of the state space is always being one of the usual ways for solving the optimal problems. the traditional ways of finding solutions only have backtracking, branch - and - bound and implicit graphs search as their theoretical introduction

    狀態空間搜索是解決優化問題的常用方法之一，傳統的狀態空間搜索求解技術有回溯法和分支限界法以及隱式圖搜索這些演算法策略作為理論指導。
  4. In the course of modeling, we present multi - step generalized gradient method and multi - stage curve fitting technique, prove convergence of multi - step generalized gradient method by using differential equation stable theory, analyze the error of multi - stage curve fitting technique by using inner space, creat knowledge base of water network system by using the maximum subordinate principle of and near - select principle of pattern recognition. at last we make the optimal running scheme of water network system based on heuristic search technique of artificial intelligence and global feedback immediate coordination method of large scale system theory

    在建立系統模型的過程中，提出了多步廣義梯度法和多層曲線擬合的建模方法，並用微分方程穩定性理論證明了多步廣度梯度法收斂性，用內積空間的有關知識對多層曲線擬合進行誤差分析;應用模糊數學中的最大隸屬度原則和模糊識別中的擇近原則和人工智慧中狀態空間表示法建立注水系統的知識庫;用人工智慧中的啟發式搜索技術和大系統理論中的具有全局反饋的直接協調法制定注水系統的優化運行方案。
  5. Our new technique avoids the space blow up of bdds, and extends the concept of bounded model checking

    由於模型檢測技術是基於對狀態空間的窮舉搜索，狀態爆炸問題是模型檢測技術面臨的主要困難。
  6. This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search

    本文提出了將組合問題歸結為狀態空間搜索問題的數學模型和通用演算法。
  7. The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem. the different material problems have different modules, but the general searching module does not vary with the problems

    一個組合問題的狀態空間求解程序由通用搜索模塊加上一個問題描述模塊組成，不同問題具有不同的問題描述模塊，通用搜索模塊不隨問題的改變而改變。
  8. The essential of csr is search in a state space defined by various knowledge sources, such as phonetics and linguistics

    連續語音識別實質上是在語音學、語言學等多層知識定義的狀態空間內搜索最符合語音輸入的詞序列。
  9. According to the basic idea of p - grid, peers exchange their information and split the search space when they meet each other. at last, each peer is only responsible for an interval of the whole search space and ma kes responses to the query requests for the data in this interval

    根據p - grid基本思想，節點間每次相遇就交換雙方的信息，對搜索空間不斷進行分割，使每個節點負責管理某一區間上數據信息並負責響應針對這些數據的查詢請求，最終搜索空間的劃分狀態在邏輯上可以用一棵二進制搜索樹表示。
  10. Though simulating the state of packing, adopting the experience of manual packing and heuristics knowledge to control the searching way and limit the search space, it changes the packing problem into the problem of searching best path in the state space

    文中對多邊形的合成技術進行了研究，通過模擬布局狀態，吸取人工布局的經驗，採用啟發式知識控制搜索方向，限制搜索空間，把布局問題轉化為在狀態空間下尋找最優路徑的問題。
  11. We put forward a new intelligent planner btff based on the enforced hill - climbing and helpful action ordering

    有用動作排序使規劃圖和狀態空間搜索更好地結合在一起。
  12. Firstly the idea of the general searching algorithms is to define one accurate compute model. then the state space searching algorithms a based on the compute model are submitted

    通用搜索演算法的思想是首先為狀態空間定義一個精確的計算模型，然後提出建立在該計算模型上的狀態空間搜索演算法a 。
  13. Most artificial intelligent planning algorithms are based on planning graph or state space search. ff based on both planning graph and heuristic state space search and performed standout in the 2nd and 3rd international planning competition

    Ff規劃器將規劃圖和啟發式狀態空間搜索原理進行了很好的結合，在兩屆ipc （ internationalplanningcompetition ）中取得了優異的成績。
  14. The method of model checking is a formal verification technique using the method of state - space search to verify if the behaviors of a given system ( the model ) satisfy a certain property that represented by temporal logic formulas, while the system presented as a kripke structure

    它通常採用狀態空間搜索的方法來檢測一個給定的計算模型是否滿足某個用時序邏輯公式表示的特定屬性。它是一個自動檢驗有限狀態並發系統的技術。
  15. Supposed algorithm b is the concrete searching algorithm for the combinatorial problem p. the parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem p in the way of the state space

    設b是求解組合問題p的具體搜索演算法，演算法a對應于演算法b的參數就是用狀態空間表示組合問題p的演算法。
  16. Abstract : the state space, search heuristics, and move generator in searching solutions to a given problem are characterized by first order language, which implies that the logical properties of a search algorithm are determined by its state space, that is, the logic describing the searching process has compactness and the class of initial states has finite close property

    文摘:搜索演算法的初始空間、搜索策略、搜索過程可以用一階語言描述，搜索演算法的邏輯性質由初始狀態空間確定.這意味著描述搜索過程的邏輯具有緊致性，初始狀態的初等類具有有限封閉性
  17. A widely used method for checking real - time systems is, according to the real - time property to be checked, to use a proper bi - simulation equivalence relation to convert the infinite - timed state space to a finite equivalence class space. the algorithm needs only to explore the finite space to get a correct answer. in most cases, exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases. in this paper, an equivalence relation is introduced to check whether a concurrent system, which is composed of a finite set of real - time automata, satisfies a linear duration property. to avoid exhaustive exploration, this paper also introduces a compatibility relation between timed states ( configurations ). based on these two relations, an algorithm is proposed to check whether a real - time automaton network satisfies a linear duration property. the cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature

    一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質，使用適當的雙向模擬等價關系使無限的狀態空間轉化為有限的狀態等價類空間.演算法只需要在這個有限的等價類空間里搜索就可以得到正確答案.但是，這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長，以至於在很多情況下，窮盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時自動機通過共享變量組成的並發系統是否滿足一個線性時段特性.同時，還引入了格局之間的兼容關系來避免對狀態等價類空間的窮盡搜索.基於這兩個關系，文章提出了一個演算法來驗證是否一個實時自動機網滿足一個線性時段特性.實例研究顯示，此演算法在某些情況下比其他一些工具有更好的時間和空間效率
  18. Management of data, atlantic city, new jersey, usa, may 1990, pp. 312 - 321. 17 lanzelotte r, valduries p, zait m. on the effectiveness of optimization search strategies for parallel execution spaces

    啟發式方法用於減少查詢執行策略的搜索空間并行執行來減少系統總體響應時間動態性保證從更精確的系統狀態信息來產生后繼的查詢執行序列。
  19. In order to apply these models to solve optimization problems, we design a parameter to control the networks dynamics. as the parameter is gradually reduced, a reverse bifurcation process results. the process starts with an unstable phase for searching global minima, followed by a stable, convergent phase

    為了利用這個機制，我們設計了一個控制參數，使得網路首先對狀態空間作暫時的搜索，然後由這個參數控制混沌動態逐漸消失並轉入類似於hopfield網路的梯度搜索，最終獲得系統的全局最優解。
  20. So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm

    本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
分享友人
分享到 Line

分享到臉書