835 search results - page 2 / 167 » Scheduling to maximize participation |
IDC
2009
Springer
14 years 21 hour ago
2009
Springer
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
WIOPT
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
ICDCS
2009
IEEE
14 years 2 months ago
2009
IEEE
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
ICPADS
2006
IEEE
13 years 11 months ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
GLOBECOM
2008
IEEE
13 years 12 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...