Search - Tree - CodeBus

Search - Tree - List

[Program doc] shujujeigou DL : 0: 详细介绍了数据结构中关于树和图的相关知识,并通过C语言实现了关于树和图的个种操作,是学习C语言和数据机构的很好好材料-detailed data on the structure of the tree and plans related knowledge, and through C language on the map of the trees and the species of operation, is learning C language and the good data good materials
Date : 2025-12-19 Size : 8.64mb User :
[Program doc] 9 DL : 0: 熟练掌握二叉树的二叉链表表示及前序创建算法与实现； 2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现； 3）掌握中序遍历线索二叉树的基本算法与实现 4）掌握中序遍历线索化二叉树的算法与实现； 5）按照实验题目要求独立完成实验内容（提交程序清单及相关实验数据与运行结果）； 6）认真书写实验报告,并按时提交。 -Master Binary tree list and the former express order to create algorithms and realize 2) proficiency in the first tree order, in sequence and post-order recursive traversal algorithm and realization 3) grasp the traversal clues to the basic binary tree algorithm and realization of 4) have a good clue of binary tree traversal algorithms and implementation 5) in accordance with the requirements of the experiment the subject independently completed the experiment content (to submit the list of procedures and related experimental data and results) 6 ) seriously write experimental reports, and submitted on time.
Date : 2025-12-19 Size : 19kb User : 川原
[Program doc] drop_target_Dlg DL : 0: You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your private data, one for the common data in order to receive data from other applications like Excel, WinWord etc. and at last, I ll give you a handy-dandy class you can derive ANY MFC object from, to make it a drop target
Date : 2025-12-19 Size : 22kb User : wuhongbing
[Program doc] ALOHA DL : 0: 随机访问网的性能仿真，附有详细文档和matlab源码-Random access network performance simulation, with detailed documentation and source code matlab
Date : 2025-12-19 Size : 107kb User : 余未
[Program doc] ss DL : 0: 在网上找的二叉树遍历的源程序,有点错误,自己改下就可以了.-Online to find the source of the tree traversal, a little bit wrong, under their own reform it.
Date : 2025-12-19 Size : 8kb User : zc
[Program doc] ch DL : 0: 堆积（heap）是树结构的第三种型态。堆积是一棵二元树，其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树可摆在左边当左子树，也可摆在右边当右子树，因此左右子树俱有相同的性质。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of their parents the value of small nodes. Accumulation are the root of the tree to ensure that the value of Maximum. This is known as the greatest performance in the reactor performance heap. Accumulation of sub-tree can be placed at the left when the left subtree can also be placed on the right when the right subtree, so there is about the same subtree of the nature of both.
Date : 2025-12-19 Size : 62kb User : 李南
[Program doc] mmse_tree_structured DL : 0: mmse tree structured approximation
Date : 2025-12-19 Size : 369kb User : james
[Program doc] link2 DL : 0: LNB coding of sppaning tr-LNB coding of sppaning tree
Date : 2025-12-19 Size : 114kb User : khatere
[Program doc] link3 DL : 0: LNB coding of sppaning tr-LNB coding of sppaning tree
Date : 2025-12-19 Size : 85kb User : khatere
[Program doc] ICND_2_Spanning_Tree_Protocol DL : 0: Spanning Tree Protocol
Date : 2025-12-19 Size : 265kb User : kien
[Program doc] Tree-Based_Construction_LDPC DL : 0: Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights. IEEE article
Date : 2025-12-19 Size : 1.14mb User : dfdfgdfg
[Program doc] Clustering DL : 0: It is a paper on Energy-Efficient Routing Protocol based on Clustering and Least Spanning Tree in Wireless Sensor Networks and other Clustering related papers presented at the 2008 International Conference on Computer Science and Software Engineering and the IEEE. -It is a paper on Energy-Efficient Routing Protocol based on Clustering and Least Spanning Tree in Wireless Sensor Networks and other Clustering related papers presented at the 2008 International Conference on Computer Science and Software Engineering and the IEEE.
Date : 2025-12-19 Size : 1.6mb User : spitgrp18
[Program doc] jcsb DL : 0: 文中研究了6种常用数字调制信号识别的特征参数集，并采用决策树判别方法进行分类识别。仿真结果表明，在SNR≥5dB时，识别正确率在99 以上，且当SNR≥20dB时，识别正确率达到100 。其特点是，算法简单，识别正确率高，达到了自动分类识别的目的，并有利于实现识别的实时化。-In this paper, we study the set of characteristic parameters of the six kinds of commonly used digital modulation signal recognition, and decision tree method for classification. The simulation results show that SNR 鈮� 5dB, the correct rate more than 99 , and when SNR 鈮� 20dB, the correct rate of 100 . Which is characterized by simple algorithm to identify the correct rate, to achieve the purpose of automatic classification and recognition, and help to identify real-time.
Date : 2025-12-19 Size : 82kb User : miller
[Program doc] Network_Loadbalancing DL : 0: The project “NETWORK LOAD BALANCING” is designed using Microsoft Visual Studio.Net 2008 as front end and Microsoft SQL Server 2005 as back end which works in .Net framework version 2.0. The coding language used is VB .Net. Many distributed real-time applications, such as audio- and video-conferencing, require the network to construct a multicast path (tree) from a sender to multiple receivers. Furthermore, real-time applications have Quality-of-Service (QoS) requirements (e.g. bandwidth). The objective of the routing protocol is to build a tree that is both feasible (i.e. satisfies the requested QoS) and least costly. The cost of a tree depends on the costs of its links. The cost of a link should reflect the effect of allocating resources to the new connection on existing and future connections. Many studies have proposed multicast algorithms to construct low-cost QoS-constrained trees.-The project “NETWORK LOAD BALANCING” is designed using Microsoft Visual Studio.Net 2008 as front end and Microsoft SQL Server 2005 as back end which works in .Net framework version 2.0. The coding language used is VB .Net. Many distributed real-time applications, such as audio- and video-conferencing, require the network to construct a multicast path (tree) from a sender to multiple receivers. Furthermore, real-time applications have Quality-of-Service (QoS) requirements (e.g. bandwidth). The objective of the routing protocol is to build a tree that is both feasible (i.e. satisfies the requested QoS) and least costly. The cost of a tree depends on the costs of its links. The cost of a link should reflect the effect of allocating resources to the new connection on existing and future connections. Many studies have proposed multicast algorithms to construct low-cost QoS-constrained trees.
Date : 2025-12-19 Size : 548kb User : Starlin T S
[Program doc] 2-3-tree DL : 0: n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements-n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements
Date : 2025-12-19 Size : 15kb User : aa
[Program doc] tree-data DL : 0: In computer science, a tree is a widely used data structure that simulates a hierarchical tree structure with a set of linked nodes. A tree can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of nodes (the "children"), with the constraints that no node is duplicated.
Date : 2025-12-19 Size : 9kb User : aa
[Program doc] Binary-tree DL : 0: 课程设计数据结构二叉树的遍历的C++语言的实现方法-Binary tree data structure traversal method
Date : 2025-12-19 Size : 1kb User : ma
[Program doc] decision-tree DL : 0: 这个是我自己整理的关于语音识别HMM模型训练部分的决策树相关学习总结-Decision tree learning summary of HMM model training for speech recognition
Date : 2025-12-19 Size : 1.42mb User : 王小雷
[Program doc] An-Efficient-Tree-based-Power-Saving-Scheme-for-W DL : 0: Wireless sensor networks with mobile sink are ex-pected to increase the flexibility for gathering information in large-scale sensing and detecting environments. Energy saving becomes one of the most important features of the sensor nodes to extend their lifetime in such networks. A novel tree-based power saving scheme is proposed in this paper to reduce the energy consumption in wireless sensor networks with mobile sink. We adopt a dynamic sorting algorithm to create a tree-cluster routing structure for the sensor nodes. The main goal of this scheme is to reduce the data transmission distances of the sensor nodes by employing the tree structure and multi-hop concepts. Based on the location of mobile sink, the distances between the sensor nodes, and the residual energy of each sensor node, the proposed scheme makes an efficient decision for creating the routing structure. The energy consumption is reduced and the lifetime is extended for the sensor nodes by balancing the network load.
Date : 2025-12-19 Size : 1.17mb User : wadgiad
[Program doc] Tree-Diagram-PPt-template DL : 0: Templates for power point tree diagram
Date : 2025-12-19 Size : 95kb User : JSJ

« 12 »