Scheduling Search Procedures
Paper i proceeding, 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.

Författare

Peter Damaschke

Chalmers, Institutionen för datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 2380 281-292

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/3-540-45465-9_25

ISBN

978-3-540-43864-9