In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
B. B. Prahlada Rao, Lalit M. Patnaik, R. C. Hansda...
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...