206 search results - page 24 / 42 » Better Bounds for Online Scheduling |
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...
LATIN
2004
Springer
14 years 29 days ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
AAMAS
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. In the multiagent meeting scheduling problem, agents negotiate with each other on behalf of their users to schedule meetings. While a number of negotiation approaches hav...