238 search results - page 42 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
JSAC
2006
14 years 9 months ago
2006
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
EMNLP
2008
14 years 11 months ago
2008
Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimi...
SODA
1990
ACM
14 years 10 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, di...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
In this paper we extend a previously introduced method for optimizing the arbitration policy employed by ServerNet routers and we evaluate the method's effect on scalability....