首页> 外文会议>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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号