網(wǎng)絡(luò)圖搜索

雙語例句

Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax. 二分搜索算法，圖形搜索算法，排序算法，以及基于樹的搜索算法比如極大極小樹，這些基本的算法或許也是重要的基礎(chǔ)。

Design of Software System in Network Graph Generation for Generation Unit's Maintenance Based on Searching Algorithm 基于路徑搜索的發(fā)電公司機(jī)組檢修網(wǎng)絡(luò)計劃軟件系統(tǒng)的設(shè)計

A plan recognition algorithm based on knowledge graph presented in this paper can change the plan recognition problem into the graph searching one. This method not only prompts efficiency but also gives the same result as Kautz's. 所提出的基于規(guī)劃知識圖的規(guī)劃識別算法把規(guī)劃的識別問題轉(zhuǎn)化為圖搜索問題，因而其效率更高，但其識別結(jié)果與Kautz方法是一致的。

United Structure of Point-Arc for Network Graph and It's Application in GISs Shortest Path Searching 圖的節(jié)點-弧段聯(lián)合結(jié)構(gòu)表示法及其在GIS最優(yōu)路徑選取中的應(yīng)用

Service composition graph can be built automatically by executing the reverse searching method. Multiple service qualities have been considered comprehensively when selecting the optimized composition plan. 通過反向搜索原子服務(wù)的方法自動生成服務(wù)組合圖，并基于多種服務(wù)質(zhì)量綜合考慮從服務(wù)組合圖中選擇最優(yōu)的服務(wù)組合方案。

Solve the problem of circle path in graph by searching 用遍歷方式求解圖中是否存在回路問題

The method makes use of closed signal flow graph matrix derived from the minimum system equations of an SC network. In the implementation of the method, the established technique of loop searching and sorting are used. 這種方法是從網(wǎng)絡(luò)的最小系統(tǒng)方程出發(fā)，推出描述網(wǎng)絡(luò)的閉合信號流圖矩陣，從而通過尋找回路和分類獲得符號網(wǎng)絡(luò)函數(shù)。

An incremental clustering algorithm that is phrase-based, online and avoiding Chinese word segmentation has been proposed based on phrase-based document index model that is incremental constructed using graph technique for Chinese searching result. 本文在一種采用圖結(jié)構(gòu)、基于短語的文檔索引模型的基礎(chǔ)上，提出了一種基于短語匹配的、在線的、無需進(jìn)行中文分詞的增量聚類算法來對中文搜索結(jié)果進(jìn)行聚類。

A similarity measure combining multiple features and layout is also presented. Two attributed graph match methods based on local searching and genetic algorithm are proposed to meet the occasions of different applications. 提出和實現(xiàn)了基于局部搜索和基于遺傳算法的兩種屬性關(guān)系圖匹配技術(shù)，可以適應(yīng)于不同的應(yīng)用需求。

This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms. 這一結(jié)果將傳統(tǒng)的顯式圖搜索與隱式圖搜索，求一個解的局部搜索與求全體解的遍歷搜索，全部統(tǒng)一到同一個模型和若干算法中去。

This article briefly illustrates the concept of graph and searching method. 對圖的概念和遍歷方法進(jìn)行了簡單的闡述。

Secondly, when searching database information associated with the graph, users can click this block and get this block name and the searching result will be displayed by using the block name as the searching keyword. 在進(jìn)行圖形查詢時，用戶點擊某個圖形塊，從圖形塊中取得圖形塊名，將塊名作為查詢關(guān)鍵詞，對數(shù)據(jù)庫進(jìn)行查詢后顯示數(shù)據(jù)庫查詢結(jié)果。

Finally we propose a rough planning algorithm based on planning graph, include the algorithm of expanding rough planning graph and the algorithm of searching the rough planning graph. 在一系列概念的基礎(chǔ)上給出了粗規(guī)劃問題的兩種求解模型，并提出基于規(guī)劃圖的粗規(guī)劃算法，包括粗規(guī)劃圖的擴(kuò)張算法和對粗規(guī)劃圖的搜索算法。

It has an operating process which includes graph acquiring, preprocessing, pattern extracting, searching and explaining, graph combining and output. 它有一個包括圖形獲取、預(yù)處理、模式抽取、搜索與解釋、圖形復(fù)合與輸出等環(huán)節(jié)的工作過程。

By using Hamilton graph, the problem of wagons 'placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power. 運用圖論中的哈密爾頓圖，可以將樹枝型專用線取送車問題，轉(zhuǎn)化為求哈密爾頓圖中權(quán)值最小的哈密爾頓回路問題。

Methods A method based on heuristic graph searching algorithm ( A algorithm) is proposed to detect carotid intima from ultrasonic images. 方法提出一種基于啟發(fā)式A算法從超聲圖像中提取頸動脈內(nèi)膜邊緣的方法。

Use SQL Solute A Algorithm in Graph Searching 圖搜索的A算法和SQL方法

We developed a new algorithm for de novo interpretation of MS/ MS spectra using graph theory and dynamic alignment between experimental spectrum and theoretical spectrum. The trustworthy peptides from de novo interpretation were used in protein identification via database searching. 我們用圖論以及實驗譜-理論譜聯(lián)配（alignment）的方法對串聯(lián)質(zhì)譜得到的實驗譜進(jìn)行從頭解析，得到了可靠的多肽序列，并應(yīng)用到數(shù)據(jù)庫搜索中鑒定了相應(yīng)的蛋白質(zhì)。

Use SQL Soluting A~ Algorithm in Graph Searching 圖搜索中A~算法的SQL解法

The application of graph deep optimization searching technology in system integration of drainage areas 圖深度優(yōu)先搜索技術(shù)在流域系統(tǒng)集成中的應(yīng)用

Because there existed high time complexity in AND/ OR graph search algorithms, it had to reduce the size of problem searching space to improve the practicability of the method. 由于與或圖搜索算法具有很高的時間復(fù)雜度，因此必須降低問題搜索空間的規(guī)模，以提高方法的實用性。

For the utilization of shape information, we improve the Contour Segment Networks model and device a object contour extraction algorithm based on deep first graph searching. 對于形狀信息的應(yīng)用，本文改進(jìn)了輪廓連接網(wǎng)絡(luò)模型，設(shè)計了一種新的基于深度優(yōu)先搜索的目標(biāo)輪廓提取算法。

So the approach of graph based link ***ysis is based on frequent subgraph searching algorithm. 因此頻繁子圖發(fā)現(xiàn)算法，是基于圖的鏈接發(fā)現(xiàn)技術(shù)的基礎(chǔ)。

To construct a motion graph, quaternion distance is introduced in finding the transition points, and the Dijkstra algorithm is implemented for searching the nearest path between two edges in the motion graph. Through creating transition movements, we can synthesize a piece of smooth motion. 采用基于四元數(shù)距離的方法來尋找過渡點進(jìn)而構(gòu)建出運動圖，引入Dijkstra算法來搜索運動圖上兩條邊之間的最短路徑，通過生成過渡運動，合成出一段平滑的運動。

When dance motions generate, system construct the motion graph for searching the motion segment, then system select motion segment that matches the mapping condition for each music segment through searching the motion graph, finally system synthetize music segment and motion segment on the time sequence. 舞蹈動作生成時，首先構(gòu)建用于檢索動作片段的動作圖，然后通過遍歷動作圖為每個音樂片段選取符合映射條件的動作片段，最后在時間序列上將音樂片段與動作片段進(jìn)行合成處理。

By constructing routing resource graph and searching all nodes of the graph by direction, the proposed method generates total and partial configurations and then uses JTAG boundary scan chain to apply test vectors on them and readback results. 本方法通過對布線資源圖中節(jié)點分方向遍歷，生成全局和局部測試配置，用JTAG施加測試向量激勵和回讀結(jié)果。