238 search results - page 37 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
110
click to vote
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
107
Voted
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Virtual Output Queuing is widely used by highspeed packet switches to overcome head-of-line blocking. This is done by means of matching algorithms. In fixed-length VOQ...