不同的神经网络

98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T,

use GA to deal with 随机机会约束规划-use GA to deal with random chance Constraint Programming

利用demon数据进行特征提取的C语言程序，欢迎交流-use demon data feature extraction C Programming Language, welcomed the exchange

CCANS-CCP的ns2源代码

参数说明： //******************************************* //    pSR 空域实部指针 //    pSI 空域虚部指针 //    pFR 频域实部指针 //    pFI 频域虚部指针 //****************************************** 输入返回数据应为2的整数次方

这是计算机本科专业算法分析课程里的一个算法，现用c#实现，供大家学习参考-This is the undergraduate professional computer algorithm analysis of the curriculum of an algorithm is used c#, for your reference learning

ex4反编译程序v2 2015 ex4反编译程序v2 2015 ex4反编译程序v2 2015 ex4反编译程序v2 2015 ex4反编译程序v2 2015 ex4反编译程序v2 2015 ex4反编译程序v2 2015 ex4反编译程序v2 2015

用MATLAB编写的求解互补问题的程序，利用的是非光滑牛顿法求解，在运筹学最优化问题中是常用的算法，代码中ncp是主函数。

LU分解法，数值分析最基本的！-LU decomposition, the most basic numerical analysis!

GCV Generalized cross-validation.广义交叉校验,用做非线性时间序列的计算，非常有用，找了好久才找到的。不要错过机会哦-GCV Generalized cross-validation. Generalized cross-validation, using nonlinear time series to do the calculation, is very useful to find for a long time to find the. Oh, do not miss the opportunity to