6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DM2026
The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
Bob Krekelberg, Alison Hsiang-Hsuan Liu, Fu-Hong Liu +2
We study online scheduling to minimize total completion time with explorable uncertainty on single and multiple machines. Each job comes with an upper limit of its processing time,…
cs.LG2026★ 6 cited
Continual Graph Learning: A Survey
Qiao Yuan, Sheng-Uei Guan, Pin Ni +4
Continual Graph Learning (CGL) enables models to incrementally learn from streaming graph-structured data without forgetting previously acquired knowledge. Experience replay is a c…