233 search results - page 15 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
ISORC
2005
IEEE
14 years 1 months ago
2005
IEEE
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...
WADS
2001
Springer
14 years 4 days ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
ISAAC
2003
Springer
14 years 27 days ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
JCM
2006
13 years 7 months ago
2006
Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. Ho...