资源列表
HuffmanCode
- 用stl 实现的哈夫曼编码，要是没学过stl 的就不要看了。-with stl achieve Huffman coding, if stl learned not to read it.
TLsvpwm4
- MATLAB的SVPWM仿真,最原始的脉宽调制方法,方便使用TI公司DSP同志使用,高手可选.-SVPWM MATLAB simulation, the most primitive pulse width modulation method, ease of use TI's DSP use, master optional.
svpwm1
- MATLAB的SVPWM仿真,为新算法,方便使用TI公司DSP同志使用,可用于异步电机控制,算法正确无误.-SVPWM MATLAB simulation of the new algorithm, ease of use TI's DSP use, can be used for asynchronous motor control, the algorithm is correct.
ChineseChess
- 用c++ 开发的中国象棋，其中有网络版和单机版 ，但由于水平有下限，单机版做得很差，电脑智商较低，党调整到很难实几分钟 电脑才能走一步。其中参考了Pc gameing这本书，这本书讲得真好。-with the development of the Chinese chess, which is the network version and the single version, but a lower level. has done a poor job of a single compute
disk
- 磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn
bstringk
- 离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive inte
knight
- 骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n * n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vert
bitree
- 用C++实现二叉树的建立，删除，添加。主要使用的是类的结构。-C realization of the establishment of binary tree, delete, add. The main category is the use of the structure.
MyloopToolbar
- 自制IE插件,实现在www.mailu.cn搜索的动能 -homemade IE plug-ins, to achieve the kinetic energy www.mailu.cn Search
20061591756639
- 出租车计价器源码啊啊 啊啊 -taximeters source ah ah ah ah ah ah ah ah
Apriori
- Apriori算法的JAVA实现A priori算法的JAVA实现
雷达数据预测
- 雷达数据预测，包括航迹仿真、卡尔曼滤波等 -radar data projections, including track simulation, Kalman filtering