Sciweavers

383 search results - page 28 / 77
» A Bound on the Total Chromatic Number
Sort
View
IPPS
2006
IEEE
14 years 4 months ago
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...
UmaMaheswari C. Devi, James H. Anderson
BMCBI
2007
153views more  BMCBI 2007»
13 years 10 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
TIT
2002
126views more  TIT 2002»
13 years 10 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
GLOBECOM
2007
IEEE
14 years 4 months ago
Performance Analysis of V-BLAST with Optimum Power Allocation
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
Victoria Kostina, Sergey Loyka
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
12 years 24 days ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...