This paper presents DPCNN(Delay Pulse Coupled Neural Network) based on PCNN and uses DPCNN to find the shortest path successfully.Meanwhile ,the algorithmof finding the shortest path based on DPCNN is described. Caulfield and Kinser in2 troduced the PCNN method to solve the maze problem and although their method also can be used to find the shortest path ,a large quantity of neurons are needed. However ,the approach proposed in this paper needed very fewer neurons than proposed by Caulfield and Kinser. In the meantime ,due to the pulse parallel transmission characteristic of DPCNN ,the approach proposed can find the short2 est path quickly. The computational complexity of our approach is only related to the length of the shortest path , and independent to the path graph complexity and the number of existing paths in the graph. The results of computer simulations show that by using the approach proposed in this paper ,we can use a small quantity of neurons to find the shortest p

时延PCNN及其用于求解最短路径[1].pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．