联合开发网   搜索   要求与建议
                登陆    注册
排序按匹配   按投票   按下载次数   按上传日期
按平台查找All C++ Builder(5) 

[人工智能/神经网络/深度学习] An-expanding-SOM

自组织映射(SOM)已成功处理的欧式旅行的鹅岭推销员问题(TSP)。通过将其邻域保持财产和 凸包属性数值模拟TSP,我们引入了一个新的SOM如神经网络,称为前panding的SOM(ESOM)的。在每一个学习的迭代,ESOM提请接近的兴奋神经元 输入的城市,并在此期间,推压它们向凸包ofcities合作。 ESOM可能收购邻里保护财产和凸包的属性 的TSP,因此它可以产生接近最优的解决方案。从理论上分析了其可行性 和经验。一个的系列ofexperiments进行合成和基准的TSP, 其大小范围从50到2400个城市。实验结果表明的优越性 通过几个典型的SOM SOM开发由Budinich,凸的ESOM 弹力网,和的克尼斯算法。虽然其解的精度是尚未与 其他一些复杂的的启发式,ESOM是之一最精确的神经网络 的TSP在文献中。
The self-organizing map (SOM) has been successfully employed to handle the Euclidean trav-eling salesman problem (TSP). By incorporating its neighborhood preserving property and the convex-hull property ofthe TSP, we introduce a new SOM-like neural network, called the ex-panding SOM (ESOM). In each learning iteration, the ESOM draws the excited neurons close to the input city, and in the meantime pushes them towards the convex-hull ofcities cooperatively. The ESOM may acquire the neighborhood preserving property and the convex-hull property of the TSP, and hence it can yield near-optimal solutions. Its feasibility is analyzed theoretically and empirically. A series ofexperiments are conducted on both synthetic and benchmark TSPs, whose sizes range from 50 to 2400 cities. Experimental results demonstrate the superiority of the ESOM over several typical SOMs such as the SOM developed by Budinich, the convex elastic net, and the KNIES algorithms. Though its solution accuracy is no (2012-12-27, C++ Builder, 337KB, 下载13次)

http://www.pudn.com/Download/item/id/2098383.html

[人工智能/神经网络/深度学习] nao_team

RoboCup足球机器人3V3 控制程序,包括动作,行为,合作。可以在Webots 机器人模拟器进行上测试和演示。
RoboCup Robot Controlers (2012-03-22, C++ Builder, 61KB, 下载38次)

http://www.pudn.com/Download/item/id/1802718.html

[人工智能/神经网络/深度学习] DijkstraPprocedures

最短路径计算,有关双标号算法的具体程序设计
Calculating the Shortest Paths by Matrix Approach* (2011-05-18, C++ Builder, 1KB, 下载2次)

http://www.pudn.com/Download/item/id/1536634.html

[人工智能/神经网络/深度学习] 6A_5016

一种基于双变异算子的遗传算法本文针对简单遗传算法(SGA)所存在的缺点和不足,提出了一种新的改进遗传算法-双变异算子GA。该想法通过将所有产生的子代个体与父代个体混合作为下一代种群,在种群选择前对适应度值较低的个体进行一次变异,然后通过选择,交叉,再一次变异产生新种群,再利用自适应算法改变交叉和变异率及最优保存策略保护历代最优个体, 经Visual C++ 软件编程计算,得到了较好的优化结果.
A mutation operator based on dual genetic algorithm (2009-04-25, C++ Builder, 18KB, 下载19次)

http://www.pudn.com/Download/item/id/730031.html

[人工智能/神经网络/深度学习] MYGA_2

遗传算法解决双变量的函数最优化问题,有按钮的界面,用bc所编,生动模拟遗传进化过程
genetic algorithm to solve the two- variable optimization function, the button interface, using bc prepared by the vivid simulation of the process of genetic evolution (2005-03-31, C++ Builder, 5KB, 下载214次)

http://www.pudn.com/Download/item/id/1112237593514710.html
总计:5