资源列表
Untitled2
- bp神经网络算法程序 神经网络扩展分类应用-bp neural network algorithm neural network expansion program classification applications
beibaoPSO
- 粒子群算法用于背包问题情况 典型组合优化问题-Particle swarm optimization for the case of the more popular knapsack problem
main
- 粒子群典型主程序 适合求取全局最优解 并且考虑失败情况 求均值代替-PSO typical main global optimal solution for strike
quzao
- 阀值去噪 用db1小波对原始信号进行3层分解并提取系数-Db1 wavelet threshold de-noising with the original signal decomposition and extraction coefficient of 3 layers
jiancehuodongduan-
- 活动段检测算法 适合特征向量提取 考虑断点情况-Activities segment detection algorithms for feature extraction breakpoint consider the case
CHAZHIFANGFA
- 使用WIN-TC编写一个程序，实现线性插值、抛物插值算法以及曲线拟合。-Using WIN-TC to write a program to achieve linear interpolation, parabolic interpolation and curve fitting algorithms.
Linear
- 对一定量的数据进行线性规划的对偶单纯形法用c语言实现-To a certain amount of data of the dual simplex method for linear programming with c language implementation
Huffman
- 构造哈夫曼树的c++实现代码，非常基础易懂，适合初学者学习。-Huffman tree structure to achieve the c++ code, very basic and easy to understand, suitable for beginners to learn.
tree
- 二叉树的建立、遍历、计算树的层数，简单易懂，合适初学者学习。-The establishment, computation tree traversal, the two fork tree layers, easy to read, suitable for beginners to learn.
sorting
- 对以下八种排序方法：直接插入排序，希尔排序，折半插入排序，起泡排序，快速排序，简单选择排序，堆排序，归并排序。进行比较-For the following eight sorting methods: direct insertion sort, shell sort, binary insertion sort, bubble sort, quick sort, simply sort, heap sort, merge sort. Compare
Huffman-Coding
- 哈夫曼编码(Huffman Coding)是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码-Huffman coding (Huffman Coding) is an encoding, Huffman coding is a variable length coding (VLC) kind. Huffman coding method proposed in 1
Josephus
- 约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列-Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respec