720 search results - page 75 / 144 » Broadcast scheduling: algorithms and complexity |
185
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
209
click to vote
CIMCA
2008
IEEE
16 years 19 days ago
2008
IEEE
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
164
Voted
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
144
Voted
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
—The LOOFA algorithm is a cell-based scheduler for CIOQ crossbar switches that can guarantee the work-conserving property in a cell-based switch if the crossbar switch works twic...
153
Voted
ICC
2008
IEEE
16 years 18 days ago
2008
IEEE
—A novel architecture was proposed in [1] to address scalability issues in large, high speed packet switches. The architecture proposed in [1], namely OBIG (output buffers with i...