The e ects of a neural network's topology on its performance are well known, yet the question of nding optimal con gurations automatically remains largely open. This paper proposes a solution to this problem for RBF networks. A selfoptimising approach, driven by an evolutionary strategy, is taken. The algorithm uses output information and a computationally e cient approximation of RBF networks to optimise the K-means clustering process by co-evolving the two determinant parameters of the network's layout: the number of centroids and the centroids' positions. Empirical results demonstrate promise.