Contract scheduling is a general technique that allows the design of systems with
interruptible capabilities, given an algorithm that is not necessarily interruptible. Previous …

This paper addresses two classes of different, yet interrelated optimization problems. The
first class of problems involves a robot that must locate a hidden target in an environment …

We study the general setting of weighted search in which a number of weighted targets are
hidden in a star-like environment, and a mobile searcher must locate a subset of targets with …

In this work, we initiate the systemic study of decision-theoretic metrics in the design and
analysis of algorithms with machine-learned predictions. We introduce approaches based …

A contract algorithm is an algorithm which is given, as part of the input, a specified amount of
allowable computation time. The algorithm must then complete its execution within the …

We consider the setting in which executions of contract algorithms are scheduled in a
processor so as to produce an interruptible system. Such algorithms offer a trade off …

In this thesis we introduce and evaluate several new models for the analysis of online
algorithms. In an online problem, the algorithm does not know the entire input from the …

Contract scheduling is a widely studied framework for designing real-time systems with
interruptible capabilities. Previous work has showed that a prediction on the interruption time …

Several well-studied online resource allocation problems can be formulated in terms of
infinite, increasing sequences of positive values, in which each element is associated with a …

This paper addresses two classes of different, yet interrelated optimization problems. The
first class of problems involves a mobile searcher that must locate a hidden target in an …