172 citations · 173 across the 2 of their papers we have counts for
2 papers
cs.MA2024★ 1 cited
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin +5
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since s…
cs.DC2020★ 172 cited
Taskflow: A Lightweight Parallel and Heterogeneous Task Graph Computing System
Tsung-Wei Huang, Dian-Lun Lin, Chun-Xun Lin +1
Taskflow aims to streamline the building of parallel and heterogeneous applications using a lightweight task graph-based approach. Taskflow introduces an expressive task graph prog…