In k-means clustering we are given a set of n data points in d-dimensional space and an integer k, and the problem is to determine a set of k points in d-space, called centers, so as to minimize the mean squared distance from each data point to its neares
Interview with Sebastian DeGuy. We discuss how small the textures can actual get, whether procedural textures can compare with textures in games like Crysis and much more
Memetic Algorithms is a population-based approach for heuristic search in optimization problems. They have shown that they are orders of magnitude faster than traditional Genetic Algorithms for some problem domains.
introduced by Marco Dorigo in 1992 in his PhD thesis, is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. They are inspired by the behavior of ants in finding paths from the colony to food.
or the one-day tutorial Essential Math for Games Programmers, which is presented every year at the Game Developer's Conference. Within you will find information about the tutorial, free tutorial materials, and some updates for the companion book.