The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Diversity and adaptation in populations of clustering ants
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On the Use of the Adjusted Rand Index as a Metric for Evaluating Supervised Classification
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Hierarchical partitioning and dynamic load balancing for scientific computation
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Computer Science Review
| Hi-index | 0.00 |
Parallel computing, network partitioning, and VLSI circuit placement are fundamental challenges in computer science These problems can be modeled as graph partitioning problems A new Similarity carrying Ant Model (SCAM) is used in the ant-based clustering algorithm to solve graph partitioning problem In the proposed model, the ant will be able to collect similar items while it moves around The flexible template mechanism had been used integrated with the proposed model to obtain the partitioning constrains Random graph has been used to compare the new model with the original ant model and the model with short-term memory The result of the experiments proves the impact of the SCAM compared with other models This performance improvement for ant clustering algorithm makes it is feasible to be used in graph portioning problem.