"Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms ..."

Andrew P. Kosoresow, Matthew P. Johnson (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-36187-1_30

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ausai/KosoresowJ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ausai/KosoresowJ02
Andrew P. Kosoresow, Matthew P. Johnson:
Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms. Australian Joint Conference on Artificial Intelligence 2002: 344-355

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.