199 search results - page 2 / 40 » Complexity of two dual criteria scheduling problems |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
104
Voted
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
90
Voted
ALIFE
2008
14 years 9 months ago
2008
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
73
Voted
TCOM
2011
14 years 4 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
SIAMJO
2008
14 years 9 months ago
2008
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...