1624 search results - page 184 / 325 » Fairness in multi-agent systems |
190
click to vote
OPODIS
2010
15 years 4 months ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
174
click to vote
WSC
2001
15 years 8 months ago
2001
We study the stability of two queueing delay-based congestion control algorithms, the (p, 1)-proportionally fair algorithm and the global optimization algorithm. We linearize the ...
159
click to vote
ESAW
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider adaptation in open systems, i.e. systems without global objects or common objectives. There are three related issues: how to make the degrees of freedom (DoFs...
175
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In multiuser systems, multiuser diversity gains can be achieved by assigning channels to users with higher channel quality. To avoid the extensive information exchange required...
183
click to vote
ECRTS
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...