In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...