Sciweavers

1095 search results - page 138 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
GLOBECOM
2006
IEEE
15 years 4 months ago
Connection Preemption in Multi-Class Networks
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uz...
BMCBI
2007
134views more  BMCBI 2007»
14 years 10 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
MOBICOM
2006
ACM
15 years 3 months ago
Analysis and implications of student contact patterns derived from campus schedules
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
Vikram Srinivasan, Mehul Motani, Wei Tsang Ooi
DAC
2006
ACM
15 years 11 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
RTCSA
1999
IEEE
15 years 2 months ago
Incorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
Hakan Aydin, Rami G. Melhem, Daniel Mossé