-
from other websites downloaded VC simulated annealing algorithm for TSP source c...
从其它网站上下载的用VC++编制的模拟退火算法求解TSP问题的源代码-from other websites downloaded VC simulated annealing algorithm for TSP source code!
- 2023-07-17 05:40:03下载
- 积分：1
-
4×4矩阵式键盘识别技术
* 注：为了有更多实用的实验程序供大家学习，部分程序参考网上的资源，
* 在此谢谢这些无私奉献的朋友...
4×4矩阵式键盘识别技术
* 注：为了有更多实用的实验程序供大家学习，部分程序参考网上的资源，
* 在此谢谢这些无私奉献的朋友-4 × 4 matrix keyboard recognition technology* Note: in order to have more practical experimental procedures for everyone to learn some of the procedures refer to online resources,* thank these selfless dedication Friend
- 2022-08-19 20:50:09下载
- 积分：1
-
IEEE on MRI fuzzy segmentation of brain images related article ,2007
IEEE中关于MRI脑图像模糊分割的相关文章，2007-2008年度最新-IEEE on MRI fuzzy segmentation of brain images related article ,2007-2008 annual update
- 2022-03-13 09:50:24下载
- 积分：1
-
GA的教学
遗传算法的教材1-GA teaching a
- 2022-08-02 23:26:57下载
- 积分：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
-
- 2023-03-08 03:25:03下载
- 积分：1
-
Game programming in artificial intelligence technology, one source book, Chapte...
《游戏编程中的人工智能技术》一书中4，5章源代码- Game programming in artificial intelligence technology, one source book, Chapter 4,5
- 2022-11-28 03:40:03下载
- 积分：1
-
人工智能实验
人工智能实验 -experimental AI Artificial Intelligence Experiment
- 2022-07-13 04:16:23下载
- 积分：1
-
K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.
- 2022-01-28 00:58:44下载
- 积分：1
-
我自己整理的，优势的系统识别信息…
我收集整理的有关于系统辨识的资料和一些方法的优缺点-I have collated the information on the system identification and the advantages and disadvantages of some methods
- 2022-03-17 20:17:18下载
- 积分：1
