- qtHelp 介绍在LINUX环境下搭建QT平台
- GetNTPTime 使用ntp（network time protocol）协议从网络时间服务器获取时间并显示出来
- utf7codec utf7 encoding
- TcpServer TCP网络通信的服务器端程序
- project.tcl profile matching in wireless network we create network and dataset and match with other users and store in array and we group
- Apriori 核心算法过程如下： 过单趟扫描数据库D计算出各个1项集的支持度
资源列表
TSP(C++)
- 遗传算法解决TSP问题C++源码，内有详细中文注释及城市距离矩阵生成工具[VC++]-genetic algorithm to solve TSP C source code, have detailed notes and urban Chinese distance matrix generation tools [VC]
aprioribyjava
- Apiror算法用java编写可以成功的挖掘出频繁项集合-Apiror algorithm can be prepared using java successful excavated frequent item sets
KNN(C++)
- knn，即k最近邻算法是模式识别中的一种比较简单而经典的分类算法-knn, k-nearest neighbor pattern recognition algorithm is a relatively simple and classic classification algorithm
fpgrowth-C
- FP-GROWTH算法的C代码,可以成功查找所有的频繁项集合-FP-GROWTH algorithm in C code, you can be successful all the frequent item sets
migongyuanchengxu
- 采用Ａ*算法解决了迷宫问题的源程序，对了解人工智能中的Ａ＊算法很有帮助的．-A * algorithm used to solve a maze problem of the source of the artificial intelligence to understand the A * algorithm very helpful.
jsjsj3
- 计算机视觉书籍 《计算机视觉》吴立德编写-computer vision books "Computer Vision" Quan prepared
xianjinsuanfa
- ，我们将着重讲述一些数学建模中常用的算法，包括神经网络算法、遗传算法、模拟退火算法和模糊数学方法。用这些算法可以较容易地解决一些很复杂的，常规算法很难解决的问题。
SGA_Delphi
- 基本遗传算法SGA的源代码，实现了基本遗传算法的流程-SGA basic genetic algorithm source code, the basic implementation of the GA process
featuresofmodulationsignals
- 一些核心期刊的调制，识别类的好文章。希望能对大家有点帮助。-some of the core issues of periodicals modulation, the identification of categories of good. The hope is to help you a bit.
OptimalClassifierofNeuralNetworks
- 基于神经网络最佳分类器通信信号的调制识别, 好文章强烈贡献-based on neural network classifiers best communication signals in the modulation recognition, a strong contribution to the excellent article
Rer
- 个人硕士论文的关于数字接收机调制解调方面的matlab程序，强烈推荐给大家.-individual master's thesis on digital receiver modulation and demodulation of Matlab procedures, We strongly recommend to.
psoC++
- 粒子群算法的C++实现，给学习粒子群算法的人借鉴使用。-PSO C realized, to study PSO people from using.