搜索结果
找到约 315 项符合
booster-tree 的查询结果
电子书籍 The emphasis of this book is on real-time application of Synopsys tools, used to combat various pro
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 optimi ...
Java编程 JXMLEditor is a XML editor developed in Java which is based on the Xerces Java parser. The goal of t
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.
行业发展研究 Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the direction
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.
其他 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Grap
此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueu ...
数据结构 13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.
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 ...
其他 函数程序设计haskell的作业
函数程序设计haskell的作业，实现一个抽象数据类型tree模块
数值算法/人工智能 The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of cla
The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of poss ...
数据结构 在图形中若于个边(edge)上加上一些值
在图形中若于个边(edge)上加上一些值，此数值称为比重( weight ) 。而此图形称为比重图形(Weight Graph ) ，若weight是成本( cost )或距离( distance ) ，则称此图形为网路( Network )。根据Spanning Tree的定义，知一个图形可有许多不同spanning tree ，在network中找出一个具有最小成本( Cost )的Spanning tree ，则此Spa ...
认证考试资料 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 ...
matlab例程 用matlab开发的人工免疫系统仿真程序
利用aiNet执行资源聚类的算法分为两部分：第一部分是aiNet学习算法，如上所述；第二部分是在获得记忆细胞矩阵M和Ab-Ab之间的dij矩阵S基础上，实现连通图的剪枝聚类。
定义 1 无向连通图G：在形态空间Sw上，以M中抗体对应的点为G的顶点，每对抗体之间的亲和力dij为G中两点连接边的权值。
定义2 最小 ...