资源列表
hopfield-for-tsp
- 利用hopfield神经网络解决50个城市tsp问题，适合初学者。-Hopfield neural network using 50 cities tsp solve problems, suitable for beginners.
moshishibie
- 模式识别较全的讲解，国内某重点大学的讲义-Pattern recognition than the whole lecture, the domestic focus of a university lecture
FDA
- Fisher线性判别分类器源代码，包括训练函数和测试函数。-Fisher Linear Discrimination (FLD) classifier source code, including training function and test function.
neuralnetworklearningalgorithm
- 人工神经网络感知器的误差学习算法，实现单层感知器的学习算法-Artificial neural network-aware device error learning algorithm, to achieve single-layer perceptron learning algorithm
DKF
- Direct Kalman Filtering Approach for GPS INS 新兴的直接卡尔曼滤波算法与用于组合导航，较传统的卡尔曼滤波有所突破和改进-Direct Kalman Filtering Approach for GPS INS
TSPN
- 无线传感器网络Tinyos环境下的时间同步算法TSPN实现代码 -Wireless sensor networks Tinyos time environment to achieve code synchronization algorithm TSPN
FTSP
- 无线传感器网络Tinyos环境下的时间同步算法FTSP实现代码-Wireless sensor networks Tinyos time environment to achieve code synchronization algorithm FTSP
bashuma
- 人工智能中经典的八数码问题，可以任意输入初始状态，运用线性表的存储结构实现，附有实验报告-Eight digital classical artificial intelligence problem, you can enter any initial state, the use of the storage structure to achieve the linear form, with a lab report
FeatureSelection
- Feature Selection using Matlab. The DEMO includes 5 feature selection algorithms: • Sequential Forward Selection (SFS) • Sequential Floating Forward Selection (SFFS) • Sequential Backward Selection (SBS) • Se
fminlbfgs_version2
- 这是一个快速的拟牛顿法程序，非常实用，非常强大-FMINLBFGS is a Memory efficient optimizer for problems such as image registration with large amounts of unknowns, and cpu-expensive gradients. Supported: - Quasi Newton Broyden–Fletcher–Goldfarb–Shanno (BFGS). -
Digital-Identification
- 数字识别小程序，使用BP神经网络，先对样本进行训练，然后对输入的数字图像进行识别，准确率一般在90 -Identify a small number of procedures, the use of BP neural network, the first train of samples, and then enter the digital image recognition, the accuracy is generally 90
HeapSort
- 最大堆的生成、堆排序，以及一个简单的最大优先队列的实现。-The largest generation heap, heap sort, as well as a simple realization of the greatest priority queue.