Sciweavers

2485 search results - page 137 / 497
» Time Bounded Frequency Computations
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 5 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
RTSS
2005
IEEE
15 years 10 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
DATE
2006
IEEE
107views Hardware» more  DATE 2006»
15 years 11 months ago
Time domain model order reduction by wavelet collocation method
In this paper, a wavelet based approach is proposed for the model order reduction of linear circuits in time domain. Compared with Chebyshev reduction method, the wavelet reductio...
Xuan Zeng, Lihong Feng, Yangfeng Su, Wei Cai, Dian...
151
Voted
RTCSA
2009
IEEE
15 years 11 months ago
Managing Imprecise Worst Case Execution Times on DVFS Platforms
Abstract—Although energy-efficient real-time task scheduling has attracted a lot of attention in the past decade, most existing results assumed deterministic execution lengths f...
Vandy Berten, Chi-Ju Chang, Tei-Wei Kuo
INFOCOM
2008
IEEE
15 years 11 months ago
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
Gianluca Rizzo, Jean-Yves Le Boudec