We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
In this paper, a decode-and-forward (DF) single relay model in a Rayleigh fading environment is considered. The outage probability and ergodic rate for this model are derived. With...
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...