樹遍歷 的英文怎麼說

中文拼音 [shùbiànlì]
樹遍歷 英文
tree traversal
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  1. With the plant bionomy the tree ' s growth mechanism is analysed. tree ' s growth model and data structure are builded, and the way of traversaling is advanced

    本文從植物生態學角度出發，根據樹的生長原理，建立生長模型及相應的數據結構，並提出該結構的遍歷演算法。
  2. In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree

    特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。
  3. Traverses the abstract syntax tree one or more times, collecting information and checking that the input program

    遍歷抽象語法樹（ abstract syntax tree ， ast ）一次或多次，收集信息並檢查輸入程序
  4. An abstract syntax tree is built after syntax analysis and traversed three times to do semantic analysis to generate the intermediate code

    在語法分析、語義分析及中間代碼生成方面，先經過語法分析建立抽象語法樹，然後對抽象語法樹進行三次遍歷完成語義分析並生成中間代碼。
  5. That makes the tree walking more explicit

    的改寫，它使得樹的遍歷演算法更明顯。
  6. We studied the relation of knowledge - points and give a personal control - tactical algriothms for learning knowledge - points. and this will help construct the personal courseware structure. as for selecting suitable knowledge - point, we also use the the history records metioned above, and attempt to find the regularation between the attributes of knowledge - point the characters of the learners

    知識點的遍歷過程即是課件的學習過程，本文從知識點之間關系的角度，建立知識點網路，給出了遍歷課件知識點網路的個性化控制策略演算法；至於選擇適合的知識點，本文利用上面已建好的數據倉庫，運用決策樹方法，找出學生特點與知識點屬性的關系，為製作課件時組織知識點提供參考。
  7. This is a heuristic strategy. it can reduce the intersection tests need to be computed between bounding volumes by tracing the traverse process in previous time to gain traverse path in current time. the correctness and validity of collision detection can be guaranteed by maintaining the tracing list

    這是一個啟發式的策略，通過跟蹤國防科學技術大學研究生院學位論文上一時間采樣點對包圍盒樹的遍歷過程，確定當前時間采樣點的遍歷路徑，從而有效地減少了遍歷過程中包圍盒相交測試的次數，提高了演算法效率，同時通過對跟蹤表的維護，保證了碰撞檢測的正確性和有效性。
  8. It leads to a declarative style of programming because it saves having to write all the tree walking and tree manipulation routines

    從而形成了聲明性的編程風格，因為避免了編寫所有的樹遍歷和樹處理常式。
  9. When the walk is completed, creates a new tree the output tree from the input tree and the rules in the templates

    遍歷完成時，按照輸入樹和模板中的規則生成一棵新樹（輸出樹） 。
  10. Sax walks the document tree bit by bit and sends out events corresponding to the current node

    Sax逐位遍歷文檔樹並發送出與當前節點相應的事件。
  11. Traversing binary tree

    遍歷二叉樹
  12. In this paper, we discuss a kind of filter generator whose filter functions have less input bits than the degree of the linear feedback shift register ( lfsr ). by analyzing the structure of the filter generator and its equivalent system, we give out a conditional search algorithm ( csa ) to attack this kind of filter generators

    針對濾波函數f （ x ）的輸入比特數m少於線性反饋移位寄存器級數n的濾波生成器，本文通過分析其等價的組合生成器的結構，以及不同節拍上驅動序列的各個符號之間的制約關系，給出了廣義解序列的概念，並提出了類似遍歷二叉樹的條件搜索演算法csa ，用於攻擊該類特殊的濾波序列。
  13. According to binary tree level traversal principle, this article embarks from fully binary tree ' s definition and the nature, and proposes a method to judge fully binary tree on the basis of traversing binary tree

    摘要從完全二叉樹的定義及性質出發，根據二叉樹的層次遍歷原則，提出了一種遍歷法判斷完全二叉樹的方法。
  14. 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協議，該演算法具有通用性。
  15. A discussion on the recursive program

    二叉樹後序遍歷的非遞歸化演算法討論
  16. The recursive and non - recursive algorithm of post - traversing binary tree

    二叉樹後序遍歷的遞歸和非遞歸演算法
  17. It can be used in any complex environment, can locate all paths from transmitter to receiver which avoid redundant calculation, and it is a standard 3 - d forecast model ; in addition, it is a point to point ray tracing method based on specular theory which do n ' t carry out the receive test ; furthermore the model adopt the reverse arithmetic which exert the tree concept in data frame and establish a virtual fountain tree permanently, the proagmme can back - search the virtual fountain tree when it is running. these operation increase the calculate speed and it result in the higher receive efficiency and precision. the thesis design a programme to compare the prediction results based on ray tracing method of virtual fountain tree between the measurement results and prediction results based on the other transmittion models. the comparsion result indicate the new model is a better model

    它可應用於任何復雜的傳播環境中，能找到發射機到接收機之間的所有電波傳播路徑而無須冗餘的計算，是一種準三維的預測模型；另外，從本質上講，它仍然是一種基於鏡像理論的點對點的射線跟蹤法，所以它無須進行接收測試；而且由於採用了反向演算法，運用數據結構中多叉樹的概念，先確定需要計算的場點位置，找出所有能從源點到達場點的射線，並且可一次性建立一個虛擬源樹，以後每次的計算只要通過對該樹進行後序遍歷即可，大大提高了運算速度，因而有較高的接收效率與精度。本文對該模型進行了相應的模擬，並將其預測結果與實測結果以及基於cost231經驗性模型和基於強力射線跟蹤確定性模型的預測結果進行了比較，結果表明了該模型的優越性。
  18. That implements the tree walking

    實現了樹的遍歷。
  19. That resolution, in turn, requires the engine to be able to navigate its way around an xml tree

    介面的類包含某些方法，這些方法用於創建按文檔次序進行操作的迭代器和樹遍歷器。
  20. A number of tree - walking optimizations are built into this macro, giving you linear - o in big - o notation - efficiencies in processing a given sxml structure ; a naive approach could easily use more memory or cpu time. see resources

    這個宏對樹遍歷進行了一些優化，可以以線性效率用大o表示法為o （ n ）處理給定的sxml結構，普通的方法很容易會佔用更多的內存和cpu時間。
分享友人
分享到 Line

分享到臉書