School: Los Alamos High
Area of Science: Biology
Proposal: Ant Colony Optimizations (ACOs) are a family of optimization algorithms used to generate solutions to combinatorial optimization problems. These problems show up in many real world situations. Using the knowledge we gained last year working on dynamic ACOs, we plan to create a more robust, efficient, and parallel ACO. It will be applied to a suitable problem for dynamic changes in the problem set. We hope to have it run on a GPU. We will write our program using C/C++ and CUDA with an optional OpenGL interface.
Sponsoring Teacher: Lee Goodwin
Mail the entire Team