邏輯搜索 的英文怎麼說

中文拼音 [luósōusuǒ]
邏輯搜索 英文
boolean search
  • : Ⅰ動1. (巡察) patrol 2. [書面語] (遮攔) blockⅡ名詞1. (巡察) patrol 2. [書面語] (山溪的邊緣) edge
  • : Ⅰ動詞(編輯; 輯錄) collect; compile; edit Ⅱ名詞(整套書籍、資料的各個部分) part; volume; division
  • : 動詞1. (尋找) collect; gather2. (搜查) search; ransack
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • 邏輯 : logic
  • 搜索 : 1 (仔細尋找) search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. The thesis discussed in detail the hardware design, software development of the system and unknown spatial target active searching question etc. the control logic relation of all the station equipments can be divided into two stages

    論文詳細討論了系統的硬體設計、軟體開發以及對空間未知目標的等問題。全站設備的控制關系分為上下兩級,下級為直接過程式控制制級,上級為集中監督控制級。
  2. Specifies a logical operation between two contains search conditions

    指定兩個包含條件之間的運算。
  3. Logical operators in search expressions

    表達式中的運算符
  4. Secondly, based on the analysis of the relationship between the processing tasks, a hybrid algorithm combined the filtered beam search algorithm with the local search algorithm is proposed

    其次,在對工序任務之間的關系深入分析的基礎上,提出一種基於過濾束演算法思想與基本鄰域演算法相結合的混合演算法。
  5. Huang zhuo ( computer software & theory ) directed by zhang jian the algorithms and tools to solve first - order logic model searching ( folms ) problem with finite domain size are studied in this thesis. the satisfiability ( sat ) problem in the prepositional logic and folms are classic problems of computer science, which are important in theory and have wide applications in a lot of real - world problems

    命題可滿足性( sat )問題和有限論域一階模型( folms )問題是計算機理論科學中的經典問題,不僅在理論上有著重要的地位,而且在許多實際問題中得到了廣泛的應用。
  6. 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基本思想,節點間每次相遇就交換雙方的信息,對空間不斷進行分割,使每個節點負責管理某一區間上數據信息並負責響應針對這些數據的查詢請求,最終空間的劃分狀態在上可以用一棵二進制樹表示。
  7. On one hand, we improve on one of the existed algorithms which named attribute reduction algorithm based on discernility matrix and logic operation. we propose a new transformation method from conjunction matrix to disjunction matrix that avoids the manual work or global search and can save the time and space. on the other hand, most traditional methods didn ’ t integrate with database operations

    主要做了兩方面的工作,一方面,對已有的基於可辨識矩陣和運算的屬性約簡演算法進行了改進,提出了一種從合取項矩陣到析取項矩陣直接轉化的方法,避免了傳統的人工轉化或全局的方法,節省了空間和時間。
  8. 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

    它通常採用狀態空間的方法來檢測一個給定的計算模型是否滿足某個用時序公式表示的特定屬性。它是一個自動檢驗有限狀態並發系統的技術。
  9. 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

    文摘:演算法的初始空間、策略、過程可以用一階語言描述,演算法的性質由初始狀態空間確定.這意味著描述過程的具有緊致性,初始狀態的初等類具有有限封閉性
  10. When calculate the correlation function of binary array pairs, using the boolean calculation instead of the decimal multiplication, using the method of count the number of 1 in binary integer to calculate the correlation function of binary array pairs, the speed of searching is obviously improved by these methods. by the algorithm introduced in this paper, the constant weight and normative perfect binary array pairs whose volume from 4 to 28 and quasi - perfect binary array pairs whose volume from 2 to 24 were searched and gi ved the new result

    此外,採用二進制整數來表示陣列,通過對整數的運算來實現陣列偶的移位變換、完全采樣變換等運算;在計算二進陣列偶的相關函數時,用整數的運算代替十進制中的乘法運算,並用計算二進制整數中1的個數的方法來計算二進陣列偶的相關函數,以上方法的採用明顯地提高了速度。利用上述演算法,對體積為4 28的等重規范型最佳二進陣列偶和體積為2 24的準最佳二進陣列偶進行了,並給出了新的結果。
  11. In which, we use cubic symbol for describing the logic function of a network in well - balanced state, then use sharp - product operation for constructing disjoint minimal path set of network. and a dps algorithm for finding out the minimal path set is also presented

    研究了網路可靠性分析的不交和演算法,應用計算機輔助綜合技術實現最小路徑的不交化;並給出一個網路所有最小路經的dfs演算法。
  12. Topics covered include : applications of rule chaining, heuristic search, logic, constraint propagation, constrained search, and other problem - solving paradigms, as well as applications of decision trees, neural nets, svms and other learning paradigms

    涉及的主題包括:鏈式規則的應用、啟發式、約束傳播、約束和其它問題解決範例,另外還有決策樹的應用、神經網路、向量機( svm )以及其它學習範例。
  13. Logical operators inside a quoted search term are ignored

    在一個引用詞內的操作員被忽略。
  14. The object browser toolbar allows you to define the browsing scope, search for objects, navigate within the objects and members panes, add references to a project, select a logical or physical view, choose the items to be displayed, and sort those items as desired

    使用「對象瀏覽器」工具欄可以進行以下操作:定義瀏覽范圍;對象;在「對象」和「成員」窗格內定位;向項目添加引用;選擇視圖或物理視圖;選擇要顯示的項,然後根據需要對這些項進行排序。
  15. Our attempt here is to show the power of the xquery to not only do data searches but also run complex business logic and transformations on that data

    我們在此的嘗試將顯示xquery不僅可以進行數據,而且可以對數據運行復雜業務和轉換。
  16. Mobile information platform is the logical extension of mms. it can be used effectively in icon and menu based applications on a number of mobile information devices

    流動資訊平臺是「全方位系統」上的延續,應用程式在眾多機種上以圖標或選單表示,讓使用者有效地叫用。
  17. This paper analyzed the logic in detail and realized the logic automatically with the method of heuristic search based on width - first searching

    本文詳細分析了防誤操作閉鎖的特點,並用啟發式和寬度優先相結合的方法實現了該的自動生成。
  18. Through the analysis on the process of hydrological time - series data mining, we can find that there are many similar parts in this process in spite of the complex composition of business logic application. therefore, the process of time series comparability search is composed of three continuous phases, such as data pretreatment, characteristic mode mining and comparability measurement. there are a lot of different algorithms performing same function in every data mining phase

    經過對水文時間序列數據挖掘過程的分析,可以得到,雖然其中的業務構成比較復雜,但其基本成份卻有許多相同或相似的部分,所以,一般可以將時間序列相似性的過程分為數據預處理、特徵模式挖掘和相似性度量等幾個連續的階段,而每個階段里都有許多完成相同功能的基本演算法。
分享友人