1259 search results - page 19 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
145
click to vote
SPAA
2004
ACM
15 years 9 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...
144
click to vote
JSAC
2008
15 years 4 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...
125
click to vote
GRAPHICSINTERFACE
1998
15 years 5 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 ...
150
click to vote
INFOCOM
2000
IEEE
15 years 8 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...
161
click to vote
MST
2002
15 years 3 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...