6939 search results - page 1246 / 1388 » Algorithm Engineering for Parallel Computation |
142
click to vote
SPAA
2004
ACM
15 years 8 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...
118
click to vote
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
In reservation-based packet scheduling algorithms for single-hop WDM networks, one of the wavelengths is used as a control channel which is shared by all of the nodes for transmit...
133
click to vote
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
Aggressive hardware-based and software-based prefetch algorithms for hiding memory access latencies were proposed to bridge the gap of the expanding speed disparity between proces...
126
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
138
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...