1259 search results - page 19 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
102
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
101
click to vote
JSAC
2008
14 years 11 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
GRAPHICSINTERFACE
1998
15 years 1 months ago
1998
In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A ...
108
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
—We address the issue of power-controlled shared channel access in future wireless networks supporting packetized data traffic, beyond the voice-oriented continuous traffic prima...
104
click to vote
MST
2002
14 years 11 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...