Sciweavers

368 search results - page 61 / 74
» Improved Online Algorithms for the Sorting Buffer Problem
Sort
View
LCTRTS
1995
Springer
14 years 4 days ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim
VLDB
1999
ACM
145views Database» more  VLDB 1999»
14 years 25 days ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
SIGIR
2008
ACM
13 years 8 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
BMCBI
2010
108views more  BMCBI 2010»
13 years 8 months ago
iGTP: A software package for large-scale gene tree parsimony analysis
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
Ruchi Chaudhary, Mukul S. Bansal, André Weh...
TON
2010
115views more  TON 2010»
13 years 3 months ago
Feedback-Based Scheduling for Load-Balanced Two-Stage Switches
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...
Bing Hu, Kwan L. Yeung