首页> 外文会议>Joint international conference on pervasive computing and the networked world >Solving Directed Hamilton Path Problem in Parallel by Improved SN P System
【24h】

Solving Directed Hamilton Path Problem in Parallel by Improved SN P System

机译:改进的SN P系统并行求解定向汉密尔顿路径问题

获取原文

摘要

The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into DHP problems. Inspired by the biological neurons, priority of rules in membrane computing, we introduce spiking neural P systems with priority and multiple output neurons into the application of DHP problems. In this paper, a new SN P System based algorithm is presented. We use neurons to stand for all the possible path and filter out the DHP we want automatically, all the processes will implement in the new SN P system. Instances indicate that the proposed SN P system based algorithm reduces the time complexity efficiently by huge parallelism.
机译:有向哈密顿路径(DHP)问题是难以在常规计算机上使用实用算法的硬计算问题之一。许多问题,包括旅行销售人员问题和最长路径问题,都可以转化为DHP问题。受生物神经元,膜计算规则优先级的启发,我们将具有优先级和多个输出神经元的尖峰神经P系统引入DHP问题的应用。本文提出了一种新的基于SN P系统的算法。我们使用神经元来代表所有可能的路径,并自动过滤出我们想要的DHP,所有过程将在新的SN P系统中实施。实例表明,所提出的基于SN P系统的算法通过巨大的并行度有效降低了时间复杂度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号