Showing results 6 to 17 of 17
< previous
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Improved competitive algorithms for online scheduling with partial job values Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003 | ||
Improved competitive algorithms for online scheduling with partial job values Proceeding/Conference:Theoretical Computer Science | 2004 | ||
Improved on-line broadcast scheduling with deadlines Journal:Journal of Scheduling | 2008 | ||
Improved on-line broadcast scheduling with deadlines Proceeding/Conference:Lecture Notes in Computer Science | 2006 | ||
Laxity helps in broadcast scheduling Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2005 | ||
Linear-time haplotype inference on pedigrees without recombinations Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | ||
Linear-time haplotype inference on pedigrees without recombinations and mating loops Journal:SIAM Journal on Computing | 2009 | ||
Online competitive algorithms for maximizing weighted throughput of unit jobs Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | ||
Online competitive algorithms for maximizing weighted throughput of unit jobs Journal:Journal of Discrete Algorithms | 2006 | ||
Online scheduling of unit jobs with bounded importance ratio Journal:International Journal of Foundations of Computer Science | 2005 | ||
Online scheduling with partial job values: Does timesharing or randomization help? Journal:Algorithmica (New York) | 2003 | ||
A tight lower bound for job scheduling with cancellation Journal:Information Processing Letters | 2006 |