6105 search results - page 754 / 1221 » A Parallel Algorithm for Bound-Smoothing |
157
click to vote
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
178
click to vote
PPSN
1998
Springer
15 years 12 months ago
1998
Springer
Optimal results for the Traveling Salesrep Problem have been reported on problems with up to 3038 cities using a GA with Edge Assembly Crossover EAX. This paper rst attempts to ind...
212
click to vote
PVM
1998
Springer
15 years 12 months ago
1998
Springer
In this paper we present Lbs, a load-management-system for network based concurrent computing. The system is built on Pt-Pvm, a library based on the PVM system. Pt-Pvm provides mes...
185
click to vote
IPPS
1997
IEEE
15 years 12 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
176
click to vote
HPDC
1996
IEEE
15 years 11 months ago
1996
IEEE
In this paper a model for scheduling in wide-area systems is described. The model is federated and utilizes a collection of local site schedulers that control the use of their res...