833 search results - page 45 / 167 » Simpler and better approximation algorithms for network desi... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Mobile ad hoc networks are typically designed and evaluated in generic simulation environments. However the real conditions in which these networks are deployed can be quite diff...
ALGORITHMICA
2000
13 years 7 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Local network coding is growing in prominence as a technique to facilitate greater capacity utilization in multi-hop wireless networks. A specific objective of such local network ...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
k- and t-optimality algorithms [9, 6] provide solutions to DCOPs that are optimal in regions characterized by its size and distance respectively. Moreover, they provide quality gu...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priori...