BP

vb环境下 匈牙利算法的解决 自己编的 仅供参考-Hungary Algorathm in vb,made by myself ,just for reference

遗传算法多点交叉算法-genetic algorithms more cross-Algorithm

该系统使用极其简便，即使 你对各种网络模型不是很深刻的了解，也可以很好的使用该系统。使用时， 你可以自己修改网络的各种参数，交互性较好，而且该系统通过大量的图示 及参数设置，可以让你了解每个应用实例实现的过程及详细步骤。-The system is extremely easy to use, even if you have to various network model is not very profound understanding can be a good use of the system. When used, you can change the network"s own parameters, interactive better, but the system through a lot of icon and parameter settings, so you can understand each application process and the realization of detailed steps.

小生境遗传优化源程序 具有非线性优化问题的解释-Niche Genetic optimization of source non-linear optimization problem

Java遗传算法库-Java genetic algorithm library

蚁群算法源程序 ，比较实用，有简要说明-蚁群算法源程序 ，比较实用，有简要说明

类AStarPathFinder实现方块状网格上的A*算法-Class AStarPathFinder realize massive grid square on the A* algorithm

模拟退火算法 模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。 模拟退火的基本思想和步骤如下： 设S＝{s1,s2,…,sn}为所有可能的状态所构成的集合， f：S―R为非负代价函数，即优化问题抽象如下： 寻找s*∈S，使得f(s*)＝min f(si) 任意si∈S （1）给定一较高初始温度T，随机产生初始状态S （2）按一定方式，对当前状态作随机扰动，产生一个新的状态S’ S’＝S＋sign(η).δ 其中δ为给定的步长， η为[－1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S* s, making f (s*) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S "S" = S+ sign (). delta where given for the step, [-1,1] Random Number

Demonstration and test of the kernel-ica package

二维核密度估计算法.以及最优化计算核宽度。-bivarite kernel estimation