i need to implement this problem :
Given a set of points in 2-dimensional space. Initial position (xi, yi) and velocity (vxi, vyi) are known for each point Pi. Its position at the given time t can be calculated as follows:
xi(t) = xi + t*vxi
yi(t) = yi + t*vyi
Implement simplified K-Means algorithm to find K clusters. Find a first occurrence during given time interval [0, T] when a system of K clusters has a Quality Measure q that is less than given value QM.
技能： 算法, C 编程, C++编程, 数学, 软件构架
查看更多： matlab implementation means algorithm, means algorithm implementation, means algorithm implementation net, ant colony optimization algorithm implementation mpi, implementation means algorithm net, mpi algorithm implementation, apriori algorithm implementation, apriori algorithm implementation visual basic, algorithm implementation matlab, means clustering implementation java, distance vector algorithm implementation, means java implementation, means algorithm, implementation means algorithm, means algorithm vbnet