138 search results - page 12 / 28 » The allocation of shared fixed costs |
87
Voted
ALGORITHMICA
2010
14 years 9 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
TMC
2008
14 years 9 months ago
2008
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
105
click to vote
CC
1998
Springer
14 years 9 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
102
click to vote
DMSN
2007
ACM
15 years 1 months ago
2007
ACM
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
IOR
2010
14 years 6 months ago
2010
We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use one se...