2 citations · 3 across the 2 of their papers we have counts for
2 papers
math.OC2009★ 1 cited
Efficiency-Loss of Greedy Schedules in Non-Preemptive Processing of Jobs with Decaying Value
Carri W. Chan, Nick Bambos
We consider the problem of dynamically scheduling J jobs on N processors for non-preemptive execution where the value of each job (or the reward garnered upon completion) decays ov…
cs.IT2009★ 2 cited
A Characterization of Max-Min SIR-Balanced Power Allocation with Applications
Sławomir Stańczak, Michał Kaliszan, Nicholas Bambos +1
We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are corrupted by the co-channel i…