-
knapsack problem Genetic Algorithm Solution
背包问题的遗传算法解法-knapsack problem Genetic Algorithm Solution
- 2023-07-29 16:40:03下载
- 积分:1
-
SOBI算法,采用二阶统计量进行盲分离。
SOBI算法,采用二阶统计量进行盲分离。-SOBI algorithm, using second-order statistic for blind separation.
- 2022-02-01 02:02:23下载
- 积分:1
-
本程序是用c语言编写的基于决策树分类方法的数据挖掘算法,它对测试集进行分类,挖掘出潜在的规则...
本程序是用c语言编写的基于决策树分类方法的数据挖掘算法,它对测试集进行分类,挖掘出潜在的规则-this procedure is used to prepare the language c decision tree classification based on the data mining algorithm, which tests set for classification, tapping the potential rules
- 2022-03-15 09:17:26下载
- 积分:1
-
自已用C++写的手势辨识,可分出四个不同的手势。
自已用C++写的手势辨识,可分出四个不同的手势。-Themselves with C++ Written gesture recognition, can be the separation of four different gestures.
- 2022-03-19 07:20:23下载
- 积分:1
-
关于遗传算法编成的一本书,有遗传算法基础的人看。较权威的一本书...
关于遗传算法编成的一本书,有遗传算法基础的人看。较权威的一本书-On the genetic algorithm into a book, a genetic algorithm-based perspective. Than the authority of a book
- 2022-02-01 22:38:27下载
- 积分:1
-
基于梯度法编写的RBF神经网络程序,实现对输入数据的逼近
基于梯度法编写的RBF神经网络程序,实现对输入数据的逼近-Gradient method based on the preparation process of the RBF neural network to achieve the approximation of the input data
- 2022-04-12 03:33:36下载
- 积分:1
-
实现文字的识别 利用比较先进的神经网络笔者已经实验 绝对可行!...
实现文字的识别 利用比较先进的神经网络笔者已经实验 绝对可行!-it is a good method to realize te recgniton of words.it is based on bp network,the author realized it!
- 2022-08-21 12:10:05下载
- 积分:1
-
利用神经网络来解决异或问题,代码是VC的
利用神经网络来解决异或问题,代码是VC的-The use of neural networks to solve the XOR problem, the code is the VC" s
- 2022-04-30 21:08:44下载
- 积分: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
-
人工智能模式识别中基于非负矩阵分解生成特征空间的算法
人工智能模式识别中基于非负矩阵分解生成特征空间的算法-artificial intelligence pattern recognition based on non-negative matrix factorization generation features of the algorithm space
- 2023-07-07 09:40:03下载
- 积分:1