This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution...
The complexity of computational grid applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applicatio...
Yoonhee Kim, Ilkyeun Ra, Sung-Yong Park, Byoung uk...
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...