833 search results - page 73 / 167 » Simpler and better approximation algorithms for network desi... |
SIGMETRICS
2009
ACM
14 years 2 months ago
2009
ACM
We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels...
ISCAS
2007
IEEE
14 years 2 months ago
2007
IEEE
—Systems on Chip (SoCs) congregate multiple modules and advanced interconnection schemes, such as networks on chip (NoCs). One relevant problem in SoC design is module mapping on...
DAC
2006
ACM
14 years 1 months ago
2006
ACM
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
JDA
2006
13 years 7 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
PET
2007
Springer
14 years 2 months ago
2007
Springer
Neither of the two anonymisation services Tor and AN.ON clearly outperforms the other one. AN.ON’s user-perceived QoS is generally more consistent over time than Tor’s. While A...