871 search results - page 156 / 175 » The vertex-cover polynomial of a graph |
87
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
74
Voted
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
60
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...