Advancing Air Force Scheduling through Modeling Problem Topologies
Final rept. 1 Apr 2003-31 May 2006
COLORADO STATE UNIV FORT COLLINS
Pagination or Media Count:
Because of the difficulties of obtaining data from real applications, researchers tend to develop their new algorithms on artificial problems and do not model what makes an algorithm successful. Developers then have little guidance on which algorithms are best for which applications. All of this makes it difficult for research results to transfer to deployment. Our project endeavored to ameliorate this situation by 1 modeling the topology of scheduling algorithms utilizing real problems of interest to the Air Force, 2 developing and evaluating new search algorithms by exploiting the modeled topology of real applications and 3 disseminating the problems, algorithms and results via a publicly available repository.
- Numerical Mathematics
- Theoretical Mathematics