657 search results - page 111 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
102
click to vote
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
126
click to vote
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
104
click to vote
JMLR
2010
14 years 6 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
118
click to vote
ICALP
2009
Springer
16 years 12 hour ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...