-
这是用实验函数
这是用实验函数--Ackley函数来检验遗传算法的优越性,其中有点小毛病,就是种群数在20个左右效果最好,一旦增加种群,结果就不大对劲了。忙了好多天,也没调出来,还请各位大侠指点喽-This is the experimental function-- Ackley function to test the advantages of genetic algorithm, with a little fault, is the number of stocks in the 20 best around, once increased stocks, the result is not very comfortable having the. Busier afterwards, it was not stressed out, please Shanhaiguan kind Lackeys
- 2022-02-25 00:04:31下载
- 积分:1
-
用遗传算法优化神经网络权值的源程序
用遗传算法优化神经网络权值的源程序-genetic algorithm optimization neural network value of the source
- 2023-01-03 23:30:03下载
- 积分:1
-
神经网络的源代码,关于字符识别的一些东西
神经网络的源代码,关于字符识别的一些东西-Neural network source code, something about character recognition
- 2022-07-15 12:32:34下载
- 积分:1
-
张文修老师主编的详细介绍遗传算法及其数学基础的一本书,研究遗传算法的一本很好的参考书,特别推荐!...
张文修老师主编的详细介绍遗传算法及其数学基础的一本书,研究遗传算法的一本很好的参考书,特别推荐!-Edited by Prof. Zhang Wenxiu, detailed genetic algorithm and its mathematical foundations, a very good reference book to study the genetic algorithm, strongly recommended!
- 2022-04-23 23:53:53下载
- 积分:1
-
Counterpropagation Network Vision 源码, 经典的CPN人工神经网络例子源码...
Counterpropagation Network Vision 源码, 经典的CPN人工神经网络例子源码-Counterpropagation Network Vision source, CPN classic example ANN FOSS
- 2022-09-23 17:40:02下载
- 积分:1
-
This is on the application of artificial neural network is applied to the stock...
这是有关于人工神经网络的应用主要是应用到股票价格的分析与预测-This is on the application of artificial neural network is applied to the stock price analysis and prediction
- 2022-02-04 07:23:10下载
- 积分:1
-
based on genetic algorithm source artificial life simulation!
基于遗传算法的人工生命模拟源程序!-based on genetic algorithm source artificial life simulation!
- 2022-03-19 21:57:17下载
- 积分:1
-
vb的波尔兹曼机(含模拟退火算法),有需要的可参考一下
vb的波尔兹曼机(含模拟退火算法),有需要的可参考一下
-vb the Boltzmann machine (with simulated annealing algorithm), the need of a reference
- 2022-11-30 20:40:03下载
- 积分:1
-
基于遗传算法优化神经网络结构源程序
基于遗传算法优化神经网络结构源程序-based on genetic algorithm optimization neural network structure source
- 2022-03-01 08:47:23下载
- 积分:1
-
us solve eight digital, BFS may lead to insufficient memory, using heuristic sea...
我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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 ...
- 2022-02-04 07:43:49下载
- 积分:1