-
java bayes的bin文件，enjoy it！
java bayes的bin文件，enjoy it！-java bayes the paper bin, enjoy it!
- 2022-09-13 11:30:04下载
- 积分：1
-
Hopfield Model Autoassociative Memory 源码, 经典的HOPFIELD人工神经网络例子源码...
Hopfield Model Autoassociative Memory 源码, 经典的HOPFIELD人工神经网络例子源码-Hopfield Model Autoassociative Memory source, HOPFIELD classic example of artificial neural network source
- 2022-10-10 12:45:02下载
- 积分：1
-
RBF神经网络应用于IRIS数据集的例子
RBF神经网络应用于IRIS数据集的例子-Am example of RBF-NN applied on IRIS Data Set
- 2022-02-13 06:21:16下载
- 积分：1
-
PID algorithm simulation program, including four bands rk algorithm.
PID algorithm simulation program, including rk 四阶算法。-PID algorithm simulation program, including four bands rk algorithm.
- 2022-04-08 17:58:49下载
- 积分：1
-
支持向量机在初学者的java程序可以很容易地使用
支持向量机中的JAVA程序 初学者可以方便使用-Support Vector Machine in the JAVA program for beginners can easily use
- 2022-09-27 12:10:03下载
- 积分：1
-
模糊规则库的实现
Fuzzy Rule Base Implamentation
- 2023-03-19 15:40:03下载
- 积分：1
-
MATLAB编写的BP神经网络程序，好用。
MATLAB编写的BP神经网络程序，好用。-MATLAB prepared by BP neural network procedures, easy to use.
- 2022-02-02 01:58:22下载
- 积分：1
-
c++的程序 有关神经网络的,请站长加我,
c++的程序 有关神经网络的,请站长加我,-c procedures of the neural network, for my head, thank you
- 2022-01-29 01:52:50下载
- 积分：1
-
该程序提供了一个计算机下国际象棋的功能，拥有完全的代码，由matlab编成的很多人工智能的函数，有详细的文档，直接运行chess.m文件即可...
该程序提供了一个计算机下国际象棋的功能，拥有完全的代码，由matlab编成的很多人工智能的函数，有详细的文档，直接运行chess.m文件即可-The program provides a computer under the functions of chess, with complete code, matlab compiled from many artificial intelligence function, has a detailed document, a document can be directly run chess.m
- 2022-07-25 03:10:04下载
- 积分：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
