activity
20232026
most citedMini-Giants: "Small" Language Models and Open Source Win-Win

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

cs.DC2025★ 1 cited

Parallel Point-to-Point Shortest Paths and Batch Queries

Xiaojun Dong, Andy Li, Yan Gu +1

We propose Orionet, efficient parallel implementations of Point-to-Point Shortest Paths (PPSP) queries using bidirectional search (BiDS) and other heuristics, with an additional fo…

cs.MA2025

CBS with Continuous-Time Revisit

Andy Li, Zhe Chen, Danial Harabor +1

Multi-Agent Path Finding in Continuous Time (\mapfr) extends the classical MAPF problem by allowing agents to operate in continuous time. Conflict-Based Search with Continuous Time…