Showing results 1 to 17 of 17
Title | Author(s) | Issue Date | |
---|---|---|---|
Aggressive online deadline scheduling Journal:Electronic Notes in Theoretical Computer Science | 2004 | ||
Allowing Mismatches In Anchors For Whole Genome Alignment Journal:W S E A S Transactions on Biology and Biomedicine | 2007 | ||
Competitive non-migratory scheduling for flow time and energy Proceeding/Conference:Annual ACM Symposium on Parallelism in Algorithms and Architectures | 2008 | ||
Deadline scheduling and power management for speed bounded processors Journal:Theoretical Computer Science | 2010 | ||
Efficiency of data distribution in BitTorrent-like systems Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
Efficient algorithms for optimizing whole genome alignment with noise Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003 | ||
Energy efficient deadline scheduling in two processor systems Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
Improved multi-processor scheduling for flow time and energy Journal:Journal of Scheduling | 2012 | ||
Improved on-line broadcast scheduling with deadlines Proceeding/Conference:Lecture Notes in Computer Science | 2006 | ||
New results on on-demand broadcasting with deadline via job scheduling with cancellation Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | ||
Nonmigratory multiprocessor scheduling for response time and energy Journal:IEEE Transactions on Parallel and Distributed Systems | 2008 | ||
Off-line algorithms for minimizing total flow time in broadcast scheduling Proceeding/Conference:Lecture Notes in Computer Science | 2005 | ||
On-line stream merging in a general setting Journal:Theoretical Computer Science | 2003 | ||
On-line stream merging, max span, and min coverage Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003 | ||
Online deadline scheduling with bounded energy efficiency Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
Sleep with guilt and work faster to minimize flow plus energy Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | ||
Speed scaling functions for flow time scheduling based on active job count Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 |