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

We introduce the study of search problems, in a setting in which the searcher has some
information, or hint concerning the hiding target. In particular, we focus on one of the …

We study the problem of searching for a hidden target in an environment that is modeled by
an edge-weighted graph. A sequence of edges is chosen starting from a given root vertex …

We study the classic problem of searching for a hidden target in the line and the $ m $-ray
star, in a setting in which the searcher has some prediction on the hider's position. We first …

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 …

We consider a single machine, a set of unit-time jobs, and a set of unit-time errors. We
assume that the time-slot at which each error will occur is not known in advance but, for …

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 search problems, a mobile searcher seeks to locate a target that hides in some unknown
position of the environment. Such problems are typically considered to be of an on-line …

In search problems, a mobile searcher seeks to locate a target that hides in some unknown
position of the environment. Such problems are typically considered to be of an on-line …

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 …