1350 search results - page 257 / 270 » Insensitive load balancing |
117
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
160
click to vote
RTAS
1997
IEEE
15 years 6 months ago
1997
IEEE
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
124
click to vote
SIGMOD
1997
ACM
15 years 6 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
117
click to vote
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
122
Voted
ISCA
1993
IEEE
15 years 6 months ago
1993
IEEE
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...