搜索资源列表
l7
- 时考虑到在哈夫曼中要每次挑选两个频率最小（即出现次数最小，我那个hNode里的value 是出现的次数），很自然的就想到了std::priority_queue容器，优先队列每次都会弹出队列 中权值最高的元素，这个特性无疑是实现哈夫曼算法的最佳选择。 ... -to consider the Huffman each selected to be the smallest two frequencies (that is, the minimum number, which I hN
ZXECF
- 最小二乘法2次曲线拟合应用已有的采样时间点，再现这些点所描述的2次曲线的变化，即求出一个二次曲线方程y=ax2+bx+c这个算法的主要问题也就是如何用给定的数据求方程系数abc-Least squares curve fitting application 2 has a sampling time points, reproduce these points 2 are described the change curve, which obtained a quadratic equatio
16-4-21
- 粒子群优化算法求Schaffer函数最小值-Particle Swarm Optimization for the minimum Schaffer function
OPT
- 对内存最佳分配算法的模拟，当有任务进入内存运行时，将满足大小要求的最小内存块分配给任务-Best memory allocation algorithm for the simulation of a task into memory when run, will meet the size requirements of the minimum memory block allocated to the task
SGA
- 自编的基于实数编码的遗传算法源程序（fortran） ，用于搜索最小值-Self-based real-coded genetic algorithm source code (fortran), used to search for the minimum