Also found in: Financial.
ACONETAkademisches Computer Netz
References in periodicals archive ?
k = Average number of CHs in a solution constructed by ant The computational complexity of ACONET can be calculated for individual steps and then these can be aggregated to represent the overall complexity
To decide about a CH to be added into a solution, in the worst case, O (n) time is required for ACONET.
ACONET takes O(k) time to increase the amount of pheromone on the links between the 'k' cluster heads related to the solution.
The results of our proposed algorithm ACONET were compared with other popular clustering algorithms i.
The number of clusters produced by ACONET are less than CLPSO and MOPSO in most cases, moreover, we varied the number of nodes from 10 to 60 to conduct these experiments.