In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
Modern application infrastructures are based on clustered, multi-tiered architectures, where request distribution occurs in two sequential stages: over a cluster of web servers, a...
Debra E. VanderMeer, Helen M. Thomas, Kaushik Dutt...