Computer Science – Artificial Intelligence
Scientific paper
2011-10-12
Journal Of Artificial Intelligence Research, Volume 27, pages 577-615, 2006
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.2038
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful experimentation and modeling of performance in real problem instances, we can relate characteristics of the best algorithms to characteristics of the application. In particular, we find that plateaus dominate the search spaces (thus favoring algorithms that make larger changes to solutions) and that some randomization in exploration is critical to good performance (due to the lack of gradient information on the plateaus). Based on our explanations of algorithm performance, we develop a new algorithm that combines characteristics of the best performers; the new algorithms performance is better than the previous best. We show how hypothesis driven experimentation and search modeling can both explain algorithm performance and motivate the design of a new algorithm.
Barbulescu L.
Howe A. E.
Roberts Matthew M.
Whitley L. D.
No associations
LandOfFree
Understanding Algorithm Performance on an Oversubscribed Scheduling Application does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Understanding Algorithm Performance on an Oversubscribed Scheduling Application, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Understanding Algorithm Performance on an Oversubscribed Scheduling Application will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634476