Voltage regulation simulation software may biggest transmission power

Boltzmann Machine Optimization 人工智能人工神经网络源码-Boltzmann Machine Optimization of artificial neural network artificial intelligence source

数据挖掘c4.5算法（vc语言版本）欢迎大家下载测试！！！！ - The data mining c4.5 algorithm (vc language edition) welcome everybody downloading test! ! ! !

有关粒子群算法的求解tsp的c++程序。-the PSO for the c tsp procedures.

BP算法的运算矩阵，很有用。-BP algorithm computing matrix, very useful.

微分进化算法DE是1995年由Rainer Storn和Kenneth Price首先提出。DE已被证明在求解过程中具有高效性、收敛性、鲁棒性等优点[5,6] 。它在许多优化问题中都表现出优于自适应模拟退火算法、POS 算法、GA算法的性能。DE利用实数值参数向量作为每一代的种群，它的自参考种群繁殖方案与其他优化算法不同。-DE was first proposed in 1995 by Rainer Storn and Kenneth Price and had been proven that it is efficient, convergent, and robust in the solution process. [5,6] In many optimize questions, its performance surpasses the adaptive simulated annealing algorithm, the POS algorithm, and the GA algorithm. DE gets each generation of population using the real value parameter vector, and the crucial idea of DE is a scheme for generating trial parameter vectors.

文本倾向性分析程序，由中国科学院计算所开发，基于LDA模型，不可外泄的内部程序，冒着被开除的风险与大家分享，欲下从速。-Tendentious text analysis program, developed by the Chinese Academy of Sciences calculated, based on the LDA model, the internal procedures can not be compromised, despite the risk of being fired to share with you, as soon as possible For the next.

matlab的典型算法（包括神经网络、遗传算法、概率算法、模拟退火算法）-matlab typical algorithms (including neural networks, genetic algorithms, probabilistic algorithms, simulated annealing algorithm)

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...

粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation).源于对鸟群捕食的行为研究 PSO同遗传算法类似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在解空间追随最优的粒子进行搜索。详细的步骤以后的章节介绍 同遗传算法比较，PSO的优势在于简单容易实现并且没有许多参数需要调整。目前已广泛应用于函数优化，神经网络训练，模糊系统控制以及其他遗传算法的应用领域-Particle Swarm Optimization (PSO) is an evolutionary technology (evolutionary computation). Predatory birds originated from the research PSO with similar genetic algorithm is based on iterative optimization tools. Initialize the system for a group of random solutions, through iterative search for the optimal values. However, there is no genetic algorithm with the cross- (crossover) and the variation (mutation). But particles in the solution space following the optimal particle search. The steps detailed chapter on the future of genetic algorithm, the advantages of PSO is simple and easy to achieve without many parameters need to be adjusted. Now it has been widely used function optimization, neural networks, fuzzy systems control and ot

一种支持向量机多专家决策算法，很有参考价值-a support vector machine algorithm experts, great reference value