Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
—In a wireless sensor network application for tracking multiple mobile targets, large amounts of sensing data can be generated by a number of sensors. These data must be controll...
LEACH (Low Energy Adaptive Clustering Hierarchy) [1] is one of the popular cluster-based structures, which has been widely proposed in wireless sensor networks. LEACH uses a TDMA ...
High-performance computing clusters running longlived tasks currently cannot have kernel software updates applied to them without causing system downtime. These clusters miss oppo...