-
没有翻译
遗传算法求解最优解求函数的最大值 : f(x,y)=21.5+x*sin(4*PI*x)+y*sin(20*PI*y) |
定义域 D: -3
- 2022-02-01 23:58:10下载
- 积分:1
-
用java编写的bp网络和rbf网络的源程序
JNNT由java语言写成,具有跨平台的优越性能.java applet的演示版更简单到只需要任何机器上的浏览...
用java编写的bp网络和rbf网络的源程序
JNNT由java语言写成,具有跨平台的优越性能.java applet的演示版更简单到只需要任何机器上的浏览器就可以运行,无需安装任何大型附加软件。更方便爱好者通过internet远程访问资源。
-with java bp prepared by the network and the networks of the source rbf JNNT by java language, cross-platform advantages can be. java applet demo version of a more simple to just any machine on the View All can be run without having to install any additional software major. Lovers more convenient remote access through the internet resources.
- 2022-03-06 00:56:58下载
- 积分:1
-
基于FIR神经网络的非线性盲信号分离
基于FIR神经网络的非线性盲信号分离-FIR based on the nonlinear neural network Blind Signal Separation
- 2023-06-08 12:55:03下载
- 积分:1
-
jnbc与weka的接口,包含src和bin文件
jnbc与weka的接口,包含src和bin文件-jnbc weka and the interface, and contains src paper bin
- 2023-06-05 00:25:03下载
- 积分:1
-
基于RBF网络的机器人手臂运动关节的仿真实例。利用RBF网络实现机器人手臂运动关节的仿真实例建模。...
基于RBF网络的机器人手臂运动关节的仿真实例。利用RBF网络实现机器人手臂运动关节的仿真实例建模。-RBF network based on the movement of the robot arm joint simulation. RBF network using the robot arm joint movement simulation modeling.
- 2023-06-09 04:40:02下载
- 积分:1
-
Genetic algorithm, said implementation of the real, to share with you about. Pra...
遗传算法的实型表示实现,与大家共享一下。实际应用中只需改变evalF.m就可以-Genetic algorithm, said implementation of the real, to share with you about. Practical application can only change evalF.m
- 2023-04-24 02:45:03下载
- 积分:1
-
数据挖掘算法,并且他们C45,CHC,FSS,ID3算法NB领域,和…
java数据挖掘算法,里面有c45,chc,fss,id3,nb等方面的算法,及相关源代码-data mining algorithms, and they C45, CHC, FSS, id3, nb areas of algorithms, and related source code
- 2022-07-08 00:54:57下载
- 积分:1
-
很好的神经网络教程,里面包含源代码,可以进行相关的修改!...
很好的神经网络教程,里面包含源代码,可以进行相关的修改!-Good neural network tutorial, which contains the source code, can be related to changes!
- 2022-03-22 05:42:04下载
- 积分:1
-
我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该...
我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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-08-06 14:22:02下载
- 积分:1
-
基于《知网》的词汇语义相似度计算Final.doc
基于《知网》的词汇语义相似度计算Final.doc-Based on the " HowNet" the vocabulary of semantic similarity calculation Final.doc
- 2023-07-18 23:25:04下载
- 积分:1