Canhui Luo

Orcid: 0000-0003-4753-3843

According to our database1, Canhui Luo authored at least 9 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A reduction framework with an improved beam search algorithm for non-slicing VLSI floorplanning.
J. Supercomput., May, 2026

An Adaptive Configuration-Aware Simulated Annealing for the Maximally Diverse Grouping Problem.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem.
Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

NS4S: Neighborhood Search for Scheduling Problems Via Large Language Models.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
MS-CLS: An Effective Partitioning and Placement Metaheuristic for Wafer-Scale Physics Modeling.
IEEE Trans. Emerg. Top. Comput. Intell., April, 2024

A General Heuristic Approach for Maximum Polygon Packing (CG Challenge).
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2022
Robust multi-agent reinforcement learning for noisy environments.
Peer-to-Peer Netw. Appl., 2022

2020
Multi-agent Fault-tolerant Reinforcement Learning with Noisy Environments.
Proceedings of the 26th IEEE International Conference on Parallel and Distributed Systems, 2020


  Loading...