1090 search results - page 5 / 218 » Priority Algorithms for Graph Optimization Problems |
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
ECRTS
2006
IEEE
14 years 1 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
SIAMCOMP
2010
13 years 2 months ago
2010
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...