Simulated annealing algorithm the document on the simulated annealing algorithm...

仿真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

文件中包含某老师关于智能优化计算课程中的遗传算法部分的讲义，其中包含详细的例子及源代码。-File contains a calculation of the teachers on the intelligent optimization of the genetic algorithm curriculum part of the lecture, which includes detailed examples and source code.

neural network in C language

SCE算法： 简单进化算法的matlab标准实现，内含3个m文件，英文说明。-SCE algorithm: a simple evolutionary algorithm matlab standards achieved, containing 3 m documents, the English description.

多核环境下运行了可满足性分析的工具软件，能够使你充分了解多核编程技术-Multi-core environment running satisfiability analysis tools, enabling you to fully understand the multi-core programming technology

一个关于HMM(隐马尔可夫模型)实现的C语言库。是Visual C++数字图像模式识别技术及工程实践的配套源代码-one of HMM (HMM) with the C library. Yes Visual C digital image pattern recognition technology and engineering practice supporting source code

特征提取技术。这种技术以传统的建模方式为前提，对于产生的模型的几何、拓扑等信息加以分析以提取其特征信息，这种技术一般多采用人工智能及模式识别等方面的知识。-feature extraction technology.

利用模拟退火法求解TSP问题 可以求得50个城市的精确解-The use of simulated annealing algorithm for solving TSP problems can be obtained 50 cities Exact Solutions

蚁群优化算法,实现人工智能解决TSP问题,如何应用ACO-Ant colony optimization algorithm, the realization of artificial intelligence to solve TSP problems, how to apply the ACO

用禁忌搜索解决TSP问题，程序中使用对路径长度禁忌的方法，运行效率比较高。-Tabu search solution TSP, procedures for the use of the taboo path length, operating more efficient.