4759 search results - page 787 / 952 » Parallelizing the Phylogeny Problem |
168
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
152
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
188
click to vote
SPAA
2004
ACM
15 years 11 months 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...
170
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
200
click to vote
VEE
2010
ACM
15 years 11 months ago
2010
ACM
Crash dump, or core dump is the typical way to save memory image on system crash for future offline debugging and analysis. However, for typical server machines with likely abund...