Search - Tree - CodeBus

Search - Tree - List

[Documents] 最小生成树耶 DL : 0: 最小生成树-minimum spanning tree
Date : 2025-12-19 Size : 1kb User : 小米
[Documents] id3ppt DL : 0: ID3决策树内容简介：概述预备知识决策树生成(Building Decision Tree) 决策树剪枝(Pruning Decision Tree) 捕捉变化数据的挖掘方法小结 -ID3 Decision Tree Description: an overview of prior knowledge to generate decision tree (Building Decision Tree) decision tree pruning (Pruning Decision Tree) to capture changes in data mining methods Summary
Date : 2025-12-19 Size : 121kb User : fff
[Documents] Binary-Tree DL : 0: 数据结构 1、算法思路：在此二叉树操作中，主要采用链式存储结构，由于遍历二叉树基本操作是访问结点，则不论按哪一种次序进行遍历，对含有n个结点的二叉树，其时间复杂度均为O(n)；空间复杂度为二叉树的高度。 -Data Structure 1, Algorithm idea: In this binary tree operation, mainly the structure of chain stores, due to the basic operation is a binary tree traversal to visit nodes, regardless of by what kind of order traversal, containing n- node of the tree, its time complexity are O (n) space complexity for the tree height.
Date : 2025-12-19 Size : 29kb User : Anson
[Documents] Huffman-tree DL : 0: 数据结构 1、算法思路：哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。 -Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Date : 2025-12-19 Size : 28kb User : Anson
[Documents] IntervalTree DL : 0: Introduction to interval tree with examples.
Date : 2025-12-19 Size : 80kb User : dongpei
[Documents] LeftistTree DL : 0: Introduction to leftist tree with examples.
Date : 2025-12-19 Size : 37kb User : dongpei
[Documents] mintree DL : 0: 最小生成树的 C语言程序绝对可以运行，-Minimum spanning tree of the C language program absolutely can run,
Date : 2025-12-19 Size : 1kb User : ul wfn
[Documents] Steiner+tree DL : 0: steiner树的文章和实现,这个东西写的很详细在图论中很有用处-Steiner tree of the articles and realized this thing written in great detail in graph theory is very useful
Date : 2025-12-19 Size : 1.91mb User : 27077
[Documents] tree DL : 0: 实现将一个树形结构中的数据拖动到另一个树形结构中的例子-A tree structure to achieve the data in the drag to another example of tree structure
Date : 2025-12-19 Size : 3kb User : 李思
[Documents] 3D-tree DL : 0: 此文档是用vistual studio 2005 开发的用来描述3D-tree 的生长过程-This document is to discribe the 3D-tree used to describe the growth process developed by vistual studio 2005
Date : 2025-12-19 Size : 304kb User : 吴洋
[Documents] tree DL : 0: 定义二叉树的结点类型，实现其最基本的操作-The definition of binary tree node type, to achieve its most basic operations
Date : 2025-12-19 Size : 1kb User : 候青
[Documents] paper DL : 0: 关于数据挖掘的分类算法，主要介绍基于不确定数据的决策树算法-With regard to the classification of data mining algorithms, mainly introduces the decision tree algorithm based on uncertain data
Date : 2025-12-19 Size : 669kb User : 任广明
[Documents] ktree-1 DL : 0: Min k tree in tabu search
Date : 2025-12-19 Size : 3kb User : Jung
[Documents] BINARY-TREE DL : 0: this is a binary tree, is made in visual studio c + +, I hope you dear users served.
Date : 2025-12-19 Size : 2.3mb User : gianjo
[Documents] wallace-tree-multiplier DL : 0: 关于fpga乘法器的一种算法，一种wallace树压缩器硬件结构的实现-An algorithm on fpga multiplier, a wallace tree compression hardware structure
Date : 2025-12-19 Size : 1.64mb User : 朴圣龙
[Documents] 13597362-C-program-for-Binary-Search-Tree-Travers DL : 0: code binary search tr-code binary search tree
Date : 2025-12-19 Size : 176kb User : ricardoszf
[Documents] Tree DL : 0: 用分形算法实现的是分形树生成，文件没有密码。-Fractal algorithm generated fractal tree, the file is not password.
Date : 2025-12-19 Size : 2kb User : lily
[Documents] file-binary-tree-run DL : 0: file binary tree run.rar
Date : 2025-12-19 Size : 1kb User : Farugh
[Documents] object-tree DL : 0: 一个很好用的树形控件，很完美，很稳定的，用javascript一定要看啊，决对不会让你失望。-A good use of the tree controls, very perfect, very stable, JavaScript must look at the ah, never let you down.
Date : 2025-12-19 Size : 739kb User : 王福地
[Documents] A Tree Based Data Aggregation Scheme for Wireless Sensor Networks Using GA DL : 0: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime.
Date : 2017-03-15 Size : 334.51kb User : atrakpc@yahoo.com

« 12 3 4 5 »