Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
Grzegorz Malewicz, Alexander Russell, Alexander A....
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...