Showing results 1 to 11 of 11
Title | Author(s) | Issue Date | |
---|---|---|---|
Average rate speed scaling Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | ||
Average rate speed scaling Journal:Algorithmica (New York) | 2011 | ||
Competitive algorithms for due date scheduling Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
Competitive algorithms for due date scheduling Journal:Algorithmica (New York) | 2011 | ||
Improved bounds for speed scaling in devices obeying the cube-root rule Proceeding/Conference:Lecture Notes In Computer Science | 2009 | ||
Non-preemptive min-sum scheduling with resource augmentation Proceeding/Conference:Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2007 | ||
Scheduling for speed bounded processors Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | ||
Speed scaling with a solar cell Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | ||
Speed scaling with a solar cell Journal:Theoretical Computer Science | 2009 | ||
Speed scaling with an arbitrary power function Proceeding/Conference:Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2009 | ||
Weighted flow time does not admit O(1)-competitive algorithms Proceeding/Conference:Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2009 |