Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms.
Andrew P. KosoresowMatthew P. JohnsonPublished in: Australian Joint Conference on Artificial Intelligence (2002)
Keyphrases
- online algorithms
- worst case
- lower bound
- average case
- upper bound
- online learning
- lower and upper bounds
- competitive ratio
- linear programming relaxation
- learning algorithm
- branch and bound algorithm
- np hard
- optimal solution
- asymptotically optimal
- nearest neighbor
- error bounds
- supervised learning
- objective function
- feature extraction