资源列表
Detailed-algorithm-for-maximum-flow
- 在网络流中如何求解最大流的算法，以及网络流中的一些定理-How to solve the network flow algorithm for maximum flow, as well as some theorems in network flow
c4.5
- c 4.5 分类算法 数据挖掘 源码-c 4.5 source data mining classification algorithms
tiny_gp
- TinyGP是一个用java实现的遗传编程程序，它实现了遗传编程基本过程-TinyGP is a highly optimised GP system that was originally developed by Riccardo Poli to meet the specifications set out in the TinyGP competition of the Genetic and Evolutionary Computation Conference (GECCO) 200
lilgp1.1.tar
- 用C和java实现的高效的遗传编程（genetic programming）库-lil-gp is a generic C genetic programming tool. It was written with a number of goals in mind: speed, ease of use
EvoLisaSource
- 使用遗传编程的方法对图像进行进化，使用50个多边形就模拟出逼真的蒙娜丽莎- created a small program that keeps a string of DNA for polygon rendering. The procedure of the program is quite simple: 0) Setup a random DNA string (application start) 1) Copy the current DNA seque
robot
- 实现机器人手臂结构，胳膊，手臂，手三者的运动-Structure of robot arm, arms, arm, hand movement of the three
data-mining
- 数据挖掘的入门书籍,书中对数据挖掘的原理和方法有很详细的介绍-The introduction of data mining
HMM
- 该模型包括两个程序： 1、根据观察序列创建一个HMM模型，利用BW算法估计HMM的参数。 2、根据已知的观察序列和HMM模型，估计观察序列的概率值，利用Forward算法 注：在HMM.cpp中分别有这两个主程序，运行一个的时候注释另一个。-The model includes two procedures: 1 sequence to create a HMM based on the observed model, the BW algorithm estimates the p
BPnew292
- BP神经网络用于实现摄像机标定，省去求解单应性方程-BP neural network used to implement camera calibration, eliminating the need to solve a single equation to be
GA
- 本遗传算法由 12 个 M 文件组成，其中 Genetic.m 包含了主函数，其余文件均为 含子函数的文件，由主函数调用。下面对包含子函数的文件进行一一说明。 -The genetic algorithm composed of 12 M file, which contains the main function Genetic.m the remaining files are files containing subroutine from the main function call
knn
- 文本分类，用KNN方法，通过计算其相似度，找出与它靠近的K个文档。-text classify
recognitionCPP
- 基于神经网络BP算法分类器设计，对两类样本进行分类-BP algorithm based on neural network classifier design, classification of the two types of samples