-
自适应步长BP神经网络训练算法,采用最小误差和梯度下降法更新权值...
自适应步长BP神经网络训练算法,采用最小误差和梯度下降法更新权值- BP neural network training anaysis, realized by using error feed back, gradient descent applied updating of synaptic weights
- 2022-02-20 23:47:47下载
- 积分:1
-
SVM的一个源程序,功能很强大,实现的结构很巧妙
SVM的一个源程序,功能很强大,实现的结构很巧妙-SVM as a source, function is very powerful and realize the structure is a clever
- 2022-01-26 00:37:09下载
- 积分:1
-
JAVA版的蚂蚁算法(Ant Colony Optimization Algorithms)
JAVA版的蚂蚁算法(Ant Colony Optimization Algorithms) -JAVA version of the ant algorithm (Ant Colony Optimization Algorithms)
- 2022-02-04 08:23:21下载
- 积分:1
-
Autolife模型是一个能够进行“开放式进化”的人工生命系统。每个Agent模型采用可以变化规则表长度的有限自动机模型建模。一方面Agent可以进行自我繁殖,...
Autolife模型是一个能够进行“开放式进化”的人工生命系统。每个Agent模型采用可以变化规则表长度的有限自动机模型建模。一方面Agent可以进行自我繁殖,同时模型中的选择机制没有采用显式的适应度函数而是采用能量消耗的简单模型而自发涌现出来,所以可以认为Agent模型是一个类Tierra系统。然而与Tierra、Avida等数字生命模型不同的是,Autolife模型进行了大大的简化,它界面友好,操作直接。虽然没有给每个Agent装配一个虚拟计算机,但是Agent与环境的耦合则可以看成一个图灵机模型,因此Agent可以通过变异而“任意”的编程序。通过Autolife模型,首先人们可以看到一般的生态系统中共存的现象:生物的大爆炸、大灭绝,Agent进化得越来越聪明;其次,用户可以通过变化不同的食物添加规则探索Agent与环境的关系;最后,如果允许Agent通过播种改变环境自动产生食物,那么组织的涌现就是一种不可避免的结果。Agent构成的组织具有自主运动的特性,还可以进行自我修复,可以说Autolife中的组织是一些真正的“活体”。-Autolife model is to conduct an "open-evolution" artificial life system. Each Agent can be used model changes the rules limited the length of the table automatic machine modeling. One Agent can be self-propagation, model selection mechanism not used Explicit the fitness function instead of using the energy consumption of a simple model to emerge spontaneously, so that the agent can be a model category Tierra system. But with Tierra, Avida digital life model is different Autolife model for greatly simplified its
- 2022-04-18 21:38:13下载
- 积分:1
-
MATLAb语言的遗传算法工具箱,比较全。
MATLAb语言的遗传算法工具箱,比较全。-MATLAb language of genetic algorithm toolbox, the entire comparison.
- 2022-02-02 03:29:05下载
- 积分:1
-
约翰威利父子。神经网络与模糊专家系统应用工程…
John Wiley & Sons,.Fuzzy Engineering Expert Systems with Neural Network Applications.[2002.ISBN0471293318]
- 2023-01-01 03:15:05下载
- 积分:1
-
一个用于地板厂家将不同长度的地板装箱的自动配比程序,输入各种型号的地板,会用智能算法计算出最佳装箱方案。程序帮助中有详细的说明。...
一个用于地板厂家将不同长度的地板装箱的自动配比程序,输入各种型号的地板,会用智能算法计算出最佳装箱方案。程序帮助中有详细的说明。-floor for a different length of the manufacturers are packing the floor ratio of the automatic procedures importation of various models on the floor will use intelligent algorithms to calculate the optimal loading of the program. Program to help with detailed explanations.
- 2022-03-21 00:29:23下载
- 积分:1
-
治疗基于代表点的聚类算法,一个数据挖掘算法…
数据挖掘算法之一,基于代表点的CURE聚类算法,该算法先把每个数据点看成一类,然后合并距离最近的类,直至类个数为所要求的个数为止。-CURE cluster algorithm based on representive point,one of data mining algorithms,classifies each data as a category firstly, then unifies categories with the nearest distance into one until the number of class is coincidence with the classes demanded.
- 2022-10-15 17:40:02下载
- 积分:1
-
遗传算法源程序evolution calculates the law origin code ,C
遗传算法源程序evolution calculates the law origin code ,C-C++,人工智能/AI-NN-PR -genetic algorithm calculates the source evolution law orig in code, C-C, AI/AI- NN-PR
- 2022-01-25 20:16: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