Showing results 17 to 32 of 32
< previous
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
The mutated subsequence problem and locating conserved genes Journal:Bioinformatics | 2005 | 211 | ||
A mutation-sensitive approach for locating conserved gene pairs between related species Proceeding/Conference:Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004 | 2004 | 109 | ||
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling Proceeding/Conference:Lecture Notes in Computer Science | 2005 | 98 | ||
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling Journal:Theoretical Computer Science | 2006 | 178 | ||
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 | 107 | ||
Non-overlapping common substrings allowing mutations Journal:Mathematics in Computer Science | 2008 | 120 | ||
Nonmigratory multiprocessor scheduling for response time and energy Journal:IEEE Transactions on Parallel and Distributed Systems | 2008 | 192 | ||
Off-line algorithms for minimizing total flow time in broadcast scheduling Proceeding/Conference:Lecture Notes in Computer Science | 2005 | 107 | ||
On-line stream merging in a general setting Journal:Theoretical Computer Science | 2003 | 176 | ||
On-line stream merging with max span and min coverage Journal:Theory of Computing Systems | 2005 | 182 | ||
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 | 90 | ||
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 | 106 | ||
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy Journal:Algorithmica (New York) | 2012 | 109 | ||
Optimizing throughput and energy in online deadline scheduling Journal:ACM Transactions on Algorithms | 2009 | 182 | ||
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 | 138 | ||
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 | 120 |