Scheduling Search Procedures

We analyze preemptive on-line scheduling against randomized adversaries, with the goal to finish an unknown distinguished target job. Our motivation comes from clinical gene search projects, but the subject leads to general theoretical questions of independent interest, including some natural but un...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 7; číslo 5; s. 349 - 364
Hlavní autor: Damaschke, Peter
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.09.2004
Témata:
Bayesian models
Candidates
Chromosomes
Comparative analysis
Computer science
Employment
Genes
Hypotheses
Motivation
Mutation
on-line algorithms
Parameter estimation
randomized adversary
Scheduling
searching
ISSN:1094-6136, 1099-1425, 1099-1425
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We analyze preemptive on-line scheduling against randomized adversaries, with the goal to finish an unknown distinguished target job. Our motivation comes from clinical gene search projects, but the subject leads to general theoretical questions of independent interest, including some natural but unusual probabilistic models. We study problem versions with known and unknown processing times of jobs and target probabilities, and models where the on-line player gets some randomized extra information about the target. For some versions we get optimal competitive ratios, expressed in terms of given parameters of instances.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1094-6136
1099-1425
1099-1425
DOI:10.1023/B:JOSH.0000036859.97424.e5