spoj dTree. Count the number of distinct elements in a given range. Usage is done using fenwick Trees. Offline algorithm for queries
標(biāo)簽： distinct elements fenwick number
上傳時(shí)間： 2014-01-20
上傳用戶：lhw888
自己編的，在VB中實(shí)現(xiàn)普里姆最小生成樹(shù)算法的代碼，有圖的，邊的權(quán)值是隨機(jī)生成的，5個(gè)節(jié)點(diǎn)，點(diǎn)“generate Tree”，就會(huì)顯示出最小樹(shù)。
標(biāo)簽：
上傳時(shí)間： 2017-04-09
上傳用戶：Andy123456
一個(gè)簡(jiǎn)單的Ext例子，里面有Ext.grid.GridPanel和Ext.Tree.TreePanel等Ext常用控件的使用，以及Ext和后臺(tái)的交互
標(biāo)簽： Ext
上傳時(shí)間： 2013-12-23
上傳用戶：qweqweqwe
伸展樹(shù)，基本數(shù)據(jù)結(jié)構(gòu)，The Tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subTrees are separated by at least two blanks.
標(biāo)簽： 樹(shù)
上傳時(shí)間： 2017-05-07
上傳用戶：JIUSHICHEN
ZigBee路由協(xié)議指的是ZigBee規(guī)范中規(guī)定的與路由相關(guān)的功能和算法部分，主要包括不同網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)下ZigBee協(xié)議數(shù)據(jù)單元的路由方式、路由發(fā)現(xiàn)和路由維護(hù)等內(nèi)容。為了達(dá)到低成本、低功耗、可靠性高等設(shè)計(jì)目標(biāo)，ZigBee網(wǎng)絡(luò)采用了Cluster-Tree與AODV路由相結(jié)合的路由算法。該包實(shí)現(xiàn)了ZIGBEE路由算法在NS2下的模擬
標(biāo)簽： ZigBee 路由協(xié)議 路由 算法
上傳時(shí)間： 2017-05-14
上傳用戶：WMC_geophy
一個(gè)實(shí)現(xiàn)struts+spring+hebernate的例子，外加一個(gè)JavaScript實(shí)現(xiàn)的Tree的都OK了。
標(biāo)簽： hebernate struts spring
上傳時(shí)間： 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.
標(biāo)簽： telecommunication represent messages Huffman
上傳時(shí)間： 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.
標(biāo)簽： branch-and-strategy Salesperson Traveling solution
上傳時(shí)間： 2013-12-29
上傳用戶：璇珠官人
) 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.
標(biāo)簽： code Compression huffman provide
上傳時(shí)間： 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.
標(biāo)簽： application real-time Synopsys emphasis
上傳時(shí)間： 2017-07-05
上傳用戶：waitingfy
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
