Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms

Kosoresow, Andrew P.; Johnson, Matthew P.

Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms (bibtex)

by Andrew P. Kosoresow, Matthew P. Johnson

Reference:

Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms (Andrew P. Kosoresow, Matthew P. Johnson), in the proceedings of Australian Joint Conference on Artificial Intelligence, 2002.

Bibtex Entry:

@inproceedings{DBLP:conf/ausai/KosoresowJ02,
  author    = {Andrew P. Kosoresow and
               Matthew P. Johnson},
  title     = {Finding Worst-Case Instances of, and Lower Bounds for, Online
               Algorithms Using Genetic Algorithms},
  booktitle = {Australian Joint Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {344-355}
}