Time-efficient maze routing algorithms on reconfigurable mesh architectures

DOI10.1006/JPDC.1997.1353zbMath0889.68081OpenAlexW2028667550MaRDI QIDQ1373865

J. Ning

Publication date: 11 June 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1997.1353

zbMATH Keywords

VLSI designrobot path planningabsolute shortest path

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (1)

EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL

This page was built for publication: Time-efficient maze routing algorithms on reconfigurable mesh architectures