-
一个采用VC编写的神经网络源代码,供大家参考。
一个采用VC编写的神经网络源代码,供大家参考。-VC prepared using a neural network source code for reference.
- 2023-06-03 10:15:03下载
- 积分:1
-
详细介绍了SVM和RVM和各自的区别…
详细介绍了SVM 和RVM的区别及各自的优点,说明RVM在很多方面优于SVM-Described in detail the difference between SVM and the RVM and their respective advantages, indicating RVM in many ways superior to SVM
- 2022-01-26 00:48:38下载
- 积分:1
-
GENNET is a genetic algorithm to optimize the weights by the 16 neurons fully co...
GENNET是一个通过遗传算法优化权重的16个神经元的全连接神经网络。训练目的是使网络在一定假设的激励下,随时间产生同目标函数同样的响应,即:可以把此网络制作为一个任意波形的信号发生器。
程序分3个示例说明遗传算法进化过程中网络输出的变化趋势。可以看出网络输出(蓝色曲线)随着时间变化逐渐逼近目标函数(红色曲线)。此程序不仅可以学习遗传算法,也可以用于研究全连接网络的直观示例。-GENNET is a genetic algorithm to optimize the weights by the 16 neurons fully connected neural networks. Training purposes is to enable network inspired by certain assumptions, over time, produce the same response with the objective function, namely: the network can be produced as an arbitrary waveform signal generator. Procedure, three examples illustrate the evolution of genetic algorithms in the network output trends. We can see that the network output (blue curve) changes over time, gradually approaching the objective function (red curve). This program can not only learn from the genetic algorithm can also be used to study visual example of a fully connected network.
- 2023-03-23 04:25:04下载
- 积分:1
-
Astar algorithm using eight digital issues. C++ written in the console applicati...
使用Astar算法实现的八数码问题。C++编写,控制台应用程序,实现简单,代码轻便。-Astar algorithm using eight digital issues. C++ written in the console application, to achieve simple and lightweight code.
- 2022-06-29 20:20: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
-
通过人工神经网络实现异或问题的解决,用visual c++开发
通过人工神经网络实现异或问题的解决,用visual c++开发-through artificial neural network or differences in the solution of problems with the development of visual c
- 2022-07-28 12:49:04下载
- 积分:1
-
用遗传算法进行排序
用遗传算法进行排序-genetic sequencing algorithms
- 2022-08-23 04:43:59下载
- 积分:1
-
MATLAB版遗传算法解TSP问题
MATLAB版遗传算法解TSP问题-MATLAB version Genetic Algorithm for the Traveling Salesman Problem
- 2022-03-26 08:22:29下载
- 积分:1
-
MATLAB程序计算的经典数学问题:最短
matlab程序计算经典数学问题:最短路和次短路问题-matlab program calculated the classical mathematical problem: The most short-circuit and sub-shortest path problem
- 2023-02-14 01:50:03下载
- 积分:1
-
使用群智能模拟OMNET网络路由
use swarm intelligence to simulate network routings in omnet-use swarm intelligence to simulate networ k routings in omnet
- 2022-03-29 02:08:27下载
- 积分:1