In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...