147 search results - page 5 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
EUC
2006
Springer
15 years 1 months ago
2006
Springer
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activiti...
66
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
90
Voted
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
80
Voted
PODC
1999
ACM
15 years 1 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...