24741 search results - page 4543 / 4949 » Virtual Network Computing |
204
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
214
Voted
ADHOCNOW
2004
Springer
16 years 5 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
172
click to vote
ICS
2004
Tsinghua U.
16 years 4 days ago
2004
Tsinghua U.
In this paper, we study energy conservation techniques for disk array-based network servers. First, we introduce a new conservation technique, called Popular Data Concentration (P...
180
click to vote
NOSSDAV
2004
Springer
16 years 3 days ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
161
click to vote
C5
2003
IEEE
16 years 2 days ago
2003
IEEE
This poster presentation introduces our first Squeak workshops offered in the context of the ALAN-K (Advanced LeArning Network in Kyoto) project (Konomi and Karuno, 2003), which i...