We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
One of the most important aspects in determining the global traffic characteristics of on-line games is to model the traffic behavior of the client. While modeling the client ON-O...
Energy efficient operations are essential to increase the lifetime of wireless sensor network. A clustering-based protocol is one approach that reduces energy by a data aggregation...