This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
In this paper, we propose and evaluate TCP-DCR. TCP-DCR makes simple modifications to the TCP congestion control algorithm to make it more robust to non-congestion events. The key ...
Abstract—We focus on resource allocation for energy harvesting devices. We analytically and numerically evaluate the performance of algorithms that determine time fair energy all...
Abstract—Two simple three-dimensional moth inspired odortracking algorithms, Counter-turner and Modified counterturner, were tested on a robotic platform. The Counter-turner uses...
Shaun Edwards, Adam J. Rutkowski, Roger D. Quinn, ...