Examples of particle swarm optimization applied to the wireless network nodes, s...

粒子群算法的vb源程序，可以自定义算法参数，实现对6个非约束性测试函数极小值的全局优化，动态显示粒子的移动。低维下，优化效果很好。直接解压，无须密码。请多指正。-PSO algorithm vb source, the algorithm can define parameters to achieve the six non-binding function tests minimum of global optimization, dynamic display particle movement. Low-dimensional, optimize the results very good. Direct decompression without passwords. Please correct.

人工智能中九宫问题的实现，初始数据随机生成，最终状态随机生成，并用图形界面显示搜索过程-AI JiuGongTu the realization of the initial data randomly generated, the final state of random generation, and using a graphical interface shows search process

首先采用某种编码方式将解空间映射到编码空间，每个编码对应问题的一个解，称为染色体或个体。一般通过随机方法确定起始的一群个体，称为种群，在种群中根据适应值或某种竞争机制选择个体，使用各种遗传操作算子产生下一代如此进化下去，直到满足期望的终止条件。-begin using some form of coding mapping to the solution space coding space, each encoding a corresponding solution to the problem, known as chromosome or individual. General randomly determined by the initial group of individuals, called stocks, the stocks based on fitness or some mechanism to choose the individual competition, the use of genetic Operator evolution of the next generation so on, until the termination meet expectations conditions.

非线性规划中求解无约束问题中的一个有效方法--模矢法(步长加速法),并用图表示出来步骤.-Nonlinear Programming Solution unconstrained problem of an effective method-- vector mode (step acceleration), and using map out steps.

人工智能的一种典型的启发式搜索算法，是一种最好优先的算法，但要加上一些约束条件。-A typical artificial intelligence heuristic search algorithm, is a priority of the best algorithm, but to add some more restrictive conditions.

这是我帮一个本科生做的毕业设计，实现的数据挖掘的k均值和k中心算法，其中包含了我做的两个二维的数据集，感觉要预先知道k的参数值，不是很方便-This is what I do to help an undergraduate graduation Design, Implementation of the Data Mining mean k and k center algorithm, which includes me to do two two-dimensional data sets, feeling to know beforehand the value of the parameter k is not easy

用bp实现的数字识别程序，用到了经典的bp算法，可移植到其他应用程序中去-bp achieve with the digital identification procedures, the use of classical bp algorithm can be transplanted to other applications go

该程序介绍了一种简单的遗传算法应用程序，采用matlab高效编程，适合于二进制编码的典型应用。-The program introduced a simple application of genetic algorithm using matlab efficient programming, suitable for the typical application binary code.

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

人工智能实验 -experimental AI Artificial Intelligence Experiment