Search Results for author:
Found 3 papers, 1 papers with code
EPTQ: Enhanced Post-Training Quantization via Hessian-guided Network-wise Optimization
In addition, we leverage the Hessian upper bound to improve the weight quantization parameters selection by focusing on the more sensitive elements in the weight tensors.
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem, an extension to the classical MAPF problem, where cooperative behavior is incorporated.
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds
In this work we revisit the complexity analysis of CBS to provide tighter bounds on the algorithm's run-time in the worst-case.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
