6105 search results - page 966 / 1221 » A Parallel Algorithm for Bound-Smoothing |
177
click to vote
SPAA
2005
ACM
16 years 5 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
189
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
173
click to vote
SPAA
2004
ACM
16 years 1 days 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...
202
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...
185
Voted
ICDCS
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper presents a new method to control the delay performance for high rate heterogeneous real-time traffic flows based on a novel traffic control algorithm which is a gene...