ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分，主要包括不同网络拓扑结构下ZigBee协议数据单元的路由方式、路由发现和路由维护等内容。为了达到低成本、低功耗、可靠性高等设计目标，ZigBee网络采用了Cluster-Tree与AODV路由相结合的路由算法。该包实现了ZIGBEE路由算法在NS2下的模拟
上传时间： 2017-05-14
上传用户：WMC_geophy
一个实现struts+spring+hebernate的例子，外加一个JavaScript实现的tree的都OK了。
上传时间： 2013-11-25
上传用户：skhlm
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem. the sourse code is to encode and decode the Huffman.
标签： telecommunication represent messages Huffman
上传时间： 2013-12-22
上传用户：ztj182002
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
标签： branch-and-strategy Salesperson Traveling solution
上传时间： 2013-12-29
上传用户：璇珠官人
二元搜尋樹簡單易懂，不過有一個問題：它並非平衡樹。本章將介紹平衡的 AVL 搜尋樹，討論它的資料結構、函式，並設計程式使用它。
标签： 二元
上传时间： 2017-05-30
上传用户：yzy6007
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
标签： code Compression huffman provide
上传时间： 2017-05-30
上传用户：yuchunhai1990
The emphasis of this book is on real-time application of Synopsys tools, used to combat various problems seen at VDSM geometries. Readers will be exposed to an effective design methodology for handling complex, submicron ASIC designs. Significance is placed on HDL coding styles, synthesis and optimization, dynamic simulation, formal verification, DFT scan insertion, links to layout, physical synthesis, and static timing analysis. At each step, problems related to each phase of the design flow are identified, with solutions and work-around described in detail. In addition, crucial issues related to layout, which includes clock tree synthesis and back-end integration (links to layout) are also discussed at length. Furthermore, the book contains in-depth discussions on the basics of Synopsys technology libraries and HDL coding styles, targeted towards optimal synthesis solution.
标签： application real-time Synopsys emphasis
上传时间： 2017-07-05
上传用户：waitingfy
JXMLEditor is a XML editor developed in Java which is based on the Xerces Java parser. The goal of this editor is to offer some features (tree view, drag & drop, syntax colorizing) to create XML documents easily. Also available as Eclipse Plugin.
标签： Java JXMLEditor developed editor
上传时间： 2013-11-30
上传用户：水口鸿胜电器
Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the directional decomposition of arbitrary N-dimensional (N ≥ 2) signals with a simple and effi cient tree-structured construction.
标签： direction Abtract propose achieve
上传时间： 2014-01-15
上传用户：凤临西北
13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.cpp 15、树 164 QueueNode.h LinkQueue.h TreeNode.h Tree.h 170 test.cpp 16、B+树 BTreeNode.h BTree.h 192 test.cpp 17、图 217 MinHeap.h Edge.h 222 Vertex.h Graph.h 224 test.cpp 18、排序 Data.h 249 QueueNode.h LinkQueue.h Sort.h 263 test.cpp
标签： MinHeap BinTreeNode BinaryTree Huffman
上传时间： 2017-08-14
上传用户：AbuGe
