搜索结果

找到约 348 项符合 TREE 的查询结果

其他书籍 The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no

The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a ...
https://www.eeworm.com/dl/542/396313.html
下载: 194
查看: 1096

Java书籍 Contains a complete archiver by Haruhiko Okumura. The archiver uses an LZ engine whose output is c

Contains a complete archiver by Haruhiko Okumura. The archiver uses an LZ engine whose output is compressed with static Huffman. The file is chopped into pieces which all get their own independent set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use essentially the same method. ZOO and L ...
https://www.eeworm.com/dl/656/140591.html
下载: 25
查看: 1111

其他 Huffman codes &#1048708 In telecommunication, how do we represent a set of messages, each with an

Huffman codes &#1048708 In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? &#1048708 To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. &#1048708 This problem c ...
https://www.eeworm.com/dl/534/406524.html
下载: 187
查看: 1064

压缩解压 This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer a

This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several lette ...
https://www.eeworm.com/dl/617/132266.html
下载: 80
查看: 1086

Linux/Unix编程 The UCL common multimedia library implements a number of algorithms and protocols needed by a number

The UCL common multimedia library implements a number of algorithms and protocols needed by a number of our applications. It compiles standalone on a range of Unix systems (Solaris, Linux, Irix, FreeBSD, MacOSX) and on Windows 95/98/NT/XP. The following protocols/algorithms are included in the libra ...
https://www.eeworm.com/dl/619/276848.html
下载: 77
查看: 1122

认证考试资料 Complete coverage of all four CCNP exams: ? EIGRP, OSPF, IS-IS, and BGP ? Optimizing routing ? IP

Complete coverage of all four CCNP exams: ? EIGRP, OSPF, IS-IS, and BGP ? Optimizing routing ? IP multicast ? IPv6 ? VLAN implementation ? Spanning Tree ? InterVLAN routing ? Layer 3 redundancy ? Wireless LANs ? VoIP in campus networks ? Campus network security ? Frame-mode MPLS ? IPsec ? Cisco devi ...
https://www.eeworm.com/dl/698/493613.html
下载: 184
查看: 1134

技术资料 基于Agent的动态路网行车最短路径求解

针对动态路网中最短路径求解算法复杂度高、计算量大、响应不及时等问题,提出基于Agent的分布式求解方法。用kd-tree将整个路网分区,每个区域由一个RMA Agent进行管理,利用多个Agent协作
https://www.eeworm.com/dl/913206.html
下载: 4
查看: 7284

人工智能/神经网络 Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two

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 const ...
https://www.eeworm.com/dl/650/444394.html
下载: 111
查看: 1088

嵌入式Linux LCD and Keyboard ARMulator model for the ADS Source Code Copy the provided ARMulate folder into y

LCD and Keyboard ARMulator model for the ADS Source Code Copy the provided ARMulate folder into your ADS directory tree at the root, for example in c:\ADSv1_1. If prompted to overwrite files, choose Yes. The batch file copy_console.bat will place the appropriate files inside the \Bin directory s ...
https://www.eeworm.com/dl/653/194185.html
下载: 82
查看: 1198

加密解密 Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access fr

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 e ...
https://www.eeworm.com/dl/519/444350.html
下载: 26
查看: 1090