-
本程序用NetLogo开放,模拟行人流。为本人亲字编程。
本程序用NetLogo开放,模拟行人流。为本人亲字编程。-the procedures used NetLogo open simulated flow. I affinity for the word programming.
- 2023-01-10 18:25:04下载
- 积分:1
-
产品设计时间智能预测方法的研究,值得借鉴一下
产品设计时间智能预测方法的研究,值得借鉴一下-product design time intelligent prediction method of research, worth learning about
- 2022-09-21 23:45:03下载
- 积分:1
-
这是明星模式识别章的课件源码,包括…
这是台湾张智星的模式识别的课件的源码,包括GMM和data clusting-This is the star pattern recognition Zhang Zhi courseware source, including the GMM and data clusting
- 2022-01-26 06:02:57下载
- 积分:1
-
人工神经网络的操作,包括网络学习,训练…
我的人工神经网络作业,包括BP网络的学习,训练和回想,初学人工神经网络的可以-My artificial neural network operation, including the BP network learning, training and recall, learning artificial neural network can
- 2022-02-05 10:20:02下载
- 积分:1
-
一篇关于遗传算法组卷的论文,论文中详尽的描述了遗传算法用于组卷的关键技术...
一篇关于遗传算法组卷的论文,论文中详尽的描述了遗传算法用于组卷的关键技术-A paper on genetic algorithm test paper, paper, a detailed description of the genetic algorithm for the key technologies Test Paper
- 2022-01-25 14:27:59下载
- 积分:1
-
遗传算法,网络故障的源代码!值得学习!欢迎下载!
遗传算法,网络故障的源代码!值得学习!欢迎下载!-genetic algorithms, network fault of the source code! Worth learning! Welcome to download!
- 2023-07-08 04:00:03下载
- 积分:1
-
k均值聚类的算法,这是通用程序!欢迎借鉴使用
k均值聚类的算法,这是通用程序!欢迎借鉴使用-k average value gathers a kind of algorithm, this is the
general routine! Welcome to profit from uses
- 2022-09-16 15:45:03下载
- 积分:1
-
neural network tsp of the simulated annealing algorithm to achieve the Matlab
神经网络中的tsp的模拟退火算法的matlab实现-neural network tsp of the simulated annealing algorithm to achieve the Matlab
- 2023-02-19 08:25:02下载
- 积分: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
-
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