CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Scheduling Search Procedures

Peter Damaschke (Institutionen för datavetenskap)
Lecture Notes in Computer Science. 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 (0302-9743). Vol. 2380 (2002), p. 281-292.
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2013-01-14. Senast ändrad 2015-02-11.
CPL Pubid: 170520


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap (2002-2004)


Data- och informationsvetenskap

Chalmers infrastruktur