229 citations · 494 across the 29 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 7 cited
Optimal Deadline Scheduling with Commitment
Shiyao Chen, Lang Tong, Ting He
We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept…
cs.IT2011★ 14 cited
The Embedding Capacity of Information Flows Under Renewal Traffic
Stefano Marano, Vincenzo Matta, Ting He +1
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application…