In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
Coercion combines flexible points, semi-automated optimization and expert guided manual code modification for adapting simulations to meet new requirements. Coercion can improve s...
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have b...
Particle-based simulations are a popular tool for researchers in various sciences. In combination with the availability of ever larger COTS clusters and the consequently increasin...