3206 search results - page 77 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
129
click to vote
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
— The Internet has witnessed a rapid growth in deployment of Web-based streaming applications during recent years. In these applications, server should be able to perform end-to-...
151
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
121
click to vote
ROBOCUP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
170
Voted
HIPEAC
2011
Springer
14 years 2 months ago
2011
Springer
In chip multiprocessors (CMPs), data accesslatency dependson the memory hierarchy organization, the on-chip interconnect (NoC), and the running workload. Reducing data access late...
148
Voted
COMBINATORICA
2010
14 years 9 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...