Scheduling Search Procedures
Paper in proceedings, 2002

We analyze preemptive on-line scheduling against randomized adversaries, where the goal is only to finish an unknown distinguished target job. The problem is motivated by a clinical gene search project, but it leads to theoretical questions of broader interest, including some natural but unusual probabilistic models. For some versions of our problem we get optimal competitive ratios, expressed by given parameters of instances.

Author

Peter Damaschke

Chalmers, Department of Computing Science

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 2380 281-292

Subject Categories

Computer and Information Science

DOI

10.1007/3-540-45465-9_25

ISBN

978-3-540-43864-9

More information

Created

10/7/2017