一种可扩展的忆阻电路图最短路径求解方法
A scalable method to find the shortest path in a graph with circuits of memristors
摘要:
在图中寻找最短路径可以应用于很多优化问题。然而,算法方法在时间和能量方面与图的大小成比例。我们提出了一种方法来解决最短路径问题,使用电路的纳米器件称为忆阻器,并验证它在不同大小和拓扑结构的图形。它是有效的实验得出的忆阻器模型和设备的可变性鲁棒。计算的时间和能量与最短路径的长度而不是图的大小有关,这使得该方法对于解决具有小路径长度的大型图特别有吸引力。
英文摘要:
Finding the shortest path in a graph has applications to a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest path problem using circuits of nanodevices called memristors and validate it on graphs of different sizes and topologies. It is both valid for an experimentally derived memristor model and robust to device variability. The time and energy of the computation scale with the length of the shortest path rather than with the size of the graph, making this method particularly attractive for solving large graphs with small path lengths.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。