search graph 中文意思是什麼

search graph 解釋
搜索圖
  • search : vt 1 搜查；檢查（身體、衣袋等）；搜索，搜尋；找；尋找。2 調查；查究；探求；追求；根究 （into）。3...
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. The matrix algorithm of search a maximum matching in bipartite graph

    求偶圖最大匹配的矩陣演算法
  2. Further more, sca was expanded to find dyad signals with a little improvement in the way of constructing the search graph in pattern finding

    通過改進構造搜索圖的方法，進而將該演算法擴展應用到二元組合模式的發現中。
  3. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  4. Graph based database system for heterogenous data that allows ranked search and browsing

    針對異構數據的基於數據庫系統的圖表，他允許分級搜索和流覽。
  5. A graph based database system for heterogenous data that allows ranked search and browsing

    針對異構數據的基於數據庫系統的圖表，他允許分級搜索和流覽。
  6. We analyze the principle of pollard rho - method and parallel collision search method using graph theory and algebra, and obtain important principle of directing the design of algorithms directed by this principle, we redesign the two algorithms, and achieve more efficient effect

    用代數和圖論的方法深入分析了pollard演算法和并行碰撞演算法的原理，獲得了指導演算法設計的重要原則，在這個原則的指導下，重新設計這兩個演算法，取得了更好的計算效果。 2
  7. In this paper, we present a system method aims at the key technique that needs solved in dimensional chain calculation, and made a in - depth research in auto search of dimensional chain graph, auto create of functional equations, calculation of functional equations etc. by the utilization of activex technique provided by cad and dll provided by mathematica we exploited tech - word computer aided dimensional chain calculation software

    本文針對尺寸鏈計算中需要解決的幾個關鍵技術，提出了復雜尺寸鏈計算的系統方法，就尺寸鏈圖自動搜索、尺寸鏈方程自動生成、功能方程的計算機求解等問題進行了深入的研究。並利用cad軟體的activex技術和專業計算軟體mathematica提供的動態連接庫技術完成了計算機輔助尺寸鏈計算軟體的構造，開發的軟體已成功應用於設計過程中。
  8. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  9. The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent

    本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中，增加了判斷簡單連接的條件，使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等，該演算法更加有效;在生成樹協議物理拓撲發現演算法中，正確使用stp 、 snmp和arp三種協議，物理拓撲發現非常準確;在vlan物理拓撲發現演算法中，正確運用了ieee802 . 1q協議，該演算法具有通用性。
  10. The results of simulation show that the hierarchical optimization functions have stronger deceptive so that the algorithms be pendulous among local optimizations. however the evolutionary mechanism based - on graph models being discussed displays its favorable characteristic of intelligent optimizing, such as to overcome deceptive and explore inherent laws on search space. ( 5 ) a method for designing a model framework of situation awareness for ucays based on object - oriented bayesian networks is presented

    模擬結果表明，本文所研究的層次化函數確實具有迷惑性，引導演算法在峰值之間飄忽不定，但即使如此，本文提出的基於圖形模型的智能優化機制依然表現出具有克服問題欺騙性，可探索問題內在規律和智能尋優的良好特性。
  11. The algorithm makes use of the node - arc structure of graph and depth - first - search, have realized the retrieval of optimum path in virtual navigation

    該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。
  12. 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 ）中取得了優異的成績。
  13. ( 2 ) utilizing the shortest path algorithm in graph theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part

    （ 2 ）運用圖論中的最短路徑搜索演算法從裝配模型中自動搜索出功能約束尺寸鏈，確定零件的功能尺寸。
  14. The system is compose of modules which form superior to subaltern and can be extended easily, so it is a good data resource for user to get the land resource dynamic movement information in qian county experiment area this system has integrity ability of data manage, it can carry through update and edit of data at any moment, it has main functions such as : browse and record attribute data, look over and graph manage of spatial database, graph edit, query and search of database, renew correlation export intellective

    該系統由從上而下的模塊結構組成，擴充性強，是用戶獲取乾縣試區土地資源動態信息的良好數據源。系統數據處理功能完整，可隨時進行數據的更新與編輯，主要功能包括：屬性數據的瀏覽與錄入、空間數據庫的查看與圖形處理、數據庫編輯、數據庫的查詢與搜索、相關專家知識的補充。
  15. Workflow is used as the information carrier and delivers task related information along with process flow. users can send information search requests to information search unit with the help of information search client to get the needed information in an efficient and precise way. ( 3 ) some key technologies for enterprise workflow information active sharing based on the proposed system framework, the detailed study on the key technologies of enterprise workflow information active sharing have been made : a directed graph based new workflow modeling method is proposed

    該結構採用企業信息索引為系統自動化的信息檢索提供支持；企業信息檢索機構負責對信息需求進行處理，推動企業信息檢索過程，並響應人工推動的企業信息檢索請求；以工作流為載體，在過程的自動化推進中主動傳遞任務所需信息，並通過信息檢索客戶端向信息檢索機構發出檢索請求來高效、準確地取得系統無法主動提供的任務所需信息。
  16. Because of the difference in environment, energy and process data, this paper uses analytic hierarchy process to build process planning evaluation model to add the relative efficiency of data. according to the result of relative index, an optimal green process planning approach is produced. the directed graph of process planning is built based on graph theory and the improved dijkstra algorithms is put forward to search the optimized process route

    由於環境、能源及工藝數據標準的不一致，為了增加數據之間的相對有效性，本文引入層次分析法，建立了工藝決策層次評價模型，通過對相關指標的計算，得出了相對綠色的工藝決策方案：引用圖形理論的基本原理，建立加工方案有向圖網路，並提出改進的迪克斯特拉演算法求解最優加工路線；最後給出綠色capp系統的原型框架和具體實現。
  17. On the other hand, lots of focus is made on the recognition based on the graph planning. based on two procedures of fast planning, build planning graph and search plan, hong jun made the goal method to solve the recognition problem in graph planning problem frame and got success. this method, compare to the other recognition methods, have a great excellence that it need not the warehouse of plans

    另一方面，基於圖規劃方法的識別方法也倍受關注，根據規劃圖的建立和搜索過程， 2000年hongjun提出的目標圖可以在圖規劃框架下解決規劃識別問題取得了很好的效果，由於它是根據規劃圖的思想建立的，因此目標圖的識別方法與傳統的規劃識別方法有顯著不同，尤其是它無須規劃庫就可以識別出目標的優點。
  18. 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演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
  19. 5. a heuristic graph search algorithm used to extract road semi - automatically mainly from low - resolution satellite imagery is presented

    5 、提出一種主要適用於低解析度遙感影像的基於啟發式圖搜索法a ~ *演算法的道路半自動提取方法。
  20. Bf : web services discovery and composition as graph search problem. in proc. the 2005 ieee international conference on e - technology, e - commerce and e - service, hong kong, 2005, pp. 784 - 786

    3基於上述技術，我們實現了服務組合和檢索引擎atc ，提供服務組合和對top k的組合服務實現檢索的任務。
分享友人
分享到 Line

分享到臉書