In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...