Sciweavers

2485 search results - page 223 / 497
» Time Bounded Frequency Computations
Sort
View
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
16 years 20 days ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
ICALP
2005
Springer
16 years 3 days ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
IPPS
2006
IEEE
16 years 18 days ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
DAC
2011
ACM
14 years 6 months ago
Generalized reliability-oriented energy management for real-time embedded applications
DVFS remains an important energy management technique for embedded systems. However, its negative impact on transient fault rates has been recently shown. In this paper, we propos...
Baoxian Zhao, Hakan Aydin, Dakai Zhu
MOBIHOC
2012
ACM
13 years 9 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff