We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
? In this paper we propose an adaptive scheduling and voltage/frequency selection algorithm which targets at energy harvesting systems. The proposed algorithm adjusts the processor...