遗传算法的VS2003工程，调试通过,An Introduction to Genetic Algorithms for Scientists and Engi...

BP神经网络的C语言实现 BP神经网络解决异或问题 canny源代码 HMM的C语言实现 isodata K-MEANS 车牌识别系统 矢量量化的C语言实现 -Neural Network C language BP neural network solution differences or problems canny source HMM C language isodata K-MEANS License Plate Recognition System Vector Quantization C Language

用c语言演绎“生命游戏",本世纪70年代，人们曾疯魔一种被称作“生命游戏”的小游戏，这种游戏相当简单。假设有一个像棋盘一样的方格网，每个方格中放置一个 生命细胞，生命细胞只有两种状态：“生”或“死”。-with language interpretation c Life "game", the 1970s, It had been a crazy demons known as the "Game of Life" of the games, this game is quite simple. Suppose a chessboard like the same grid, each square place a living cell, cell lives only two states : "Health" or "dead."

把 sequential 有导师学习问题转化为传统的有导师学习问题，是weka机器学习系统（本站可下载）的一个拓展-instructors put sequential learning into traditional learning instructors, weka machine learning system (download site), an expansion

遗传算法在ＭＡＴＬＡＢ环境中的实现.rar-genetic algorithm in MATLAB environment is achieved. Rar

本程序是用java语言编写的数据挖掘分类算法中的决策树分类方法c4.5程序代码-this procedure is used java language classification of data mining algorithms decision tree classification code Bank

仿真1：首先把网络温度参数T固定在100，按工作规则共进行1000次状态更新,把这1000次状态转移中网络中的各个状态出现的次数Si（i＝1，2，…，16）记录下来 按下式计算各个状态出现的实际频率： Pi=Si/∑i=1,NSi=Si/M 同时按照Bo1tzmann分布计算网络各个状态出现概率的理论值： Q（Ei）=（1/Z）exp（-Ei/T） 仿真2：实施降温方案，重新计算 采用快速降温方案：T（t）= T0/（1+t） T从1000降到0.01，按工作规则更新网络状态 当T=0.01时结束降温，再让T保持在0.01进行1000次状态转移，比较两种概率-a simulation : First of all network parameters temperature T fixed at 100 and, according to the rules for a total of 1000 to update the state, this state of the 1000 network transfer of all states for the number of Si (i = 1, 2, ..., 16) all recorded determined by the formula state-of the actual frequency : Pi = Si/i = 1, NSi = Si/M in accordance with Bo1tzmann distributed computing network of states all probability the theoretical value : Q (Ei) = (1/Z) exp (- Ei/T) Simulation 2 : implementation of cooling, re-using rapid cooling programs : T (t) = T0/(1 t) T dropped to 0.01 from 1000 and, according to the rules updated network state when T = 0.01 at the end of cooling, let T at 0.01 for the 1000 state tran

基于遗传算法实现的人工控制的登月工程的模拟程序-based on genetic algorithm to achieve the artificial control of the simulated lunar landing procedures

K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.

这是用matlab编写的用遗传算法优化神经网络的程序-using Matlab is prepared by using genetic algorithm optimization procedures for neural networks

机器人接口程序框架，需要搞机器人的同志不用自己搞框架了-Robot interface program framework, the need to engage in robot comrades do not have to engage in the framework of the