Search - binary AND tree

Search - binary AND tree - List

[AI-NN-PR] ID3算法源程序(C语言) DL : 1: ID3算法源程序。使用的方法是编写一个*.dat文件保存样本数据，还有一个*.tag文件保存属性列名，且最后一个属性是标号属性。运行是输入id3 文件名。输出格式是一个二叉判定树。-ID3 algorithm source. The method used was to prepare a document preservation*. dat sample data, a document preservation*. tag attributes listed, and the final one is the attribute label attributes. Running importation id3 file. Output format is a binary decision tree.
Date : 2026-01-01 Size : 4kb User : 小丁
[AI-NN-PR] SuanFa DL : 0: 各种数值算法，包括：二叉树、贪心算法、搜索算法、遗传算法、模拟退火算法、分治策略等等。-A variety of numerical algorithms, including: binary tree, greedy algorithm, search algorithm, genetic algorithm, simulated annealing algorithm, sub-rule tactics and so on.
Date : 2026-01-01 Size : 174kb User : 张光炜
[AI-NN-PR] illness-diagnosis DL : 0: 此为疾病诊断专家系统，用这种结构建立的知识库可以很方便地实现上面所提到的各种功能。这种结构的最独特之处就是依靠相同的关键（疾病名或其代码）来实现一种疾病与其症候之间的相互联系。疾病名与症候分别用二叉树进行排序。排序后可由疾病名而查到与该疾病名有关的所有详细情况，也可由一种症候而查到哪些疾病有这种症候，以及该症候可能引起各种疾病的概率。-This is the disease diagnosis expert system, using this structure to establish the knowledge base can easily realize the above mentioned features. The structure of the most unique is that relying on the same key (the disease or its code) to achieve a disease and its symptoms between. Name and symptoms of disease were treated with binary tree sort. Sort by the disease after the name of the disease were found with all the details of which can also be a symptom of the diseases that have found such a symptom, as well as the symptoms may lead to the probability of various diseases.
Date : 2026-01-01 Size : 28kb User : lanlan
[AI-NN-PR] HeapsortCodes DL : 0: Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
Date : 2026-01-01 Size : 192kb User : 黃文岩
[AI-NN-PR] shiyanbaogao DL : 0: 动态查找表的设计与实现,实现抽象数据类型：二叉查找树。实现下列操作:构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素. -Dynamic look-up table of the design and implementation to achieve the abstract data types: binary search tree. To achieve the following: construct an empty table, destroy the table, the search element of the specified keyword, insert a new element, delete the specified keyword element traverse all the elements in the table.
Date : 2026-01-01 Size : 108kb User : richer
[AI-NN-PR] two_shape_tree DL : 0: 在MATLAB 用云模型实现二叉分形树，写的很详细，有参考和学习价值-Cloud model implementation in MATLAB using the binary fractal tree, write a very detailed, with reference to and learning the value of
Date : 2026-01-01 Size : 8kb User : 大熊
[AI-NN-PR] SplayTree DL : 0: A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time.
Date : 2026-01-01 Size : 2kb User : a32
[AI-NN-PR] Games DL : 0: Bayes分类器——算法设计 1．使用决策树(Decision tree)分类算法、朴素贝叶斯（Naï ve Bayes）算法或者K-近邻（kNN）算法（三者任选其一）对给定的训练数据集构造分类器，并在测试数据集上进行分类预测。 2．数据集描述： Tic-tac-toe游戏的二叉分类。Tic-tac-toe游戏示例如下-Bayes classifier- Algorithm 1. Using the decision tree (Decision tree) classification algorithm, Naive Bayes (Naï ve Bayes) algorithm or K-nearest neighbor (kNN) algorithm (choose any one of three) on a given set of training data classification structure, and the test data Classification and Prediction on the set. 2. Data set description: Tic-tac-toe game binary classification. Tic-tac-toe game example is as follows
Date : 2026-01-01 Size : 1.37mb User : vera
[AI-NN-PR] Pqd_My_v11 DL : 0: 电能质量检测平台仿真测试软件，用于验证各种检测算法的有效性，其中涉及小波变换，S变换，二叉树结构的支持向量机分类算法。-Power quality detection platform simulation test software used to verify the validity of the detection algorithm, which involves the wavelet transform, S transform and support vector machines for classification of the binary tree structure.
Date : 2026-01-01 Size : 29.35mb User : panfenghou
[AI-NN-PR] TSP DL : 0: TSP问题是一个典型的、容易描述但是难以处理的NP完全问题，同时TSP问题也是诸多领域内出现的多种复杂问题的集中概括和简化形式。目前求解TSP问题的主要方法有启发式搜索法、模拟退火算法、遗传算法、Hopfield神经网络算法、二叉树描述算法。所以，有效解决TSP问题在计算理论上和实际应用上都有很高的价值，而且TSP问题由于其典型性已经成为各种启发式的搜索、优化算法的间接比较标准(如遗传算法、神经网络优化、列表寻优(TABU)法、模拟退火法等)。遗传算法就其本质来说，主要是解决复杂问题的一种鲁棒性强的启发式随机搜索算法。因此遗传算法在TSP问题求解方面的应用研究，对于构造合适的遗传算法框架、建立有效的遗传操作以及有效地解决TSP问题等有着多方面的重要意义。-The TSP The problem is a typical, easy to describe but difficult to handle the NP-complete problem, the TSP many areas centralized summarized and simplified form of a variety of complex issues. The main method of solving TSP heuristic search method, simulated annealing, genetic algorithm, Hopfield neural network algorithm, the binary tree to describe the algorithm. Therefore, an effective solution to the TSP has a very high value in the calculation of the theoretical and practical applications, and TSP problem has become due to its typical variety of heuristic search, optimization of indirect comparison standard (such as genetic algorithms, neural networks optimization list optimization (TABU), simulated annealing, etc.). The genetic algorithm is by its very nature, a robustness to solve complex problems heuristic random search algorithm. Genetic algorithm TSP problem solving aspects of applied research, genetic algorithm framework for constructing a suitable, effective genetic manipul
Date : 2026-01-01 Size : 1.22mb User : 孟晓龙