84 search results - page 10 / 17 » Schemes for SR-Tree packing |
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
IPL
2007
13 years 7 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
TWC
2008
13 years 7 months ago
2008
Scheduling in a broadcast channel based on partial channel-state-information at the transmitter is carried out in an opportunistic way. In this paper, the number of generated beams...
IPCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
A study of the performance of a number of different multiplexing schemes was conducted in the context of streaming of MPEG-4 object-based content, with particular emphasis on stre...
DAC
2002
ACM
14 years 8 months ago
2002
ACM
We extend in this paper the concept of the P-admissible floorplan representation to that of the P*-admissible one. A P*-admissible representation can model the most general floorp...