Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
: This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making ...