2252 search results - page 142 / 451 » Lower Bounds for Dynamic Algorithms |
120
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
119
click to vote
TON
2008
15 years 3 months ago
2008
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
152
Voted
ESA
1993
Springer
15 years 7 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
122
Voted
AAIM
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
127
click to vote
ICCCN
2007
IEEE
15 years 9 months ago
2007
IEEE
In the past decade cluster computing platforms have been widely applied to support a variety of scientific and commercial applications, many of which are parallel in nature. Howev...