Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
This paper presents quantitative comparison of the performance of different methods for selecting the guide particle for multi-objective particle swarm optimization (MOPSO). Two p...
David Ireland, Andrew Lewis, Sanaz Mostaghim, Junw...
Today, several data-storage systems allow applications to create and manage custom metadata to improve data search and navigability in large-scale storage systems. Our thesis is t...
This paper develops a scalable online optimization framework for the autonomic performance management of distributed computing systems operating in a dynamic environment to satisf...
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...