Sciweavers

1095 search results - page 26 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
15 years 6 months ago
An efficient wake-up schedule during power mode transition considering spurious glitches phenomenon
—During the power mode transition, a large surge current may lead to the malfunctions in a power-gating design. In this paper, we introduce several important properties of the s...
Yu-Ting Chen, Da-Cheng Juan, Ming-Chao Lee, Shih-C...
IPCO
2007
98views Optimization» more  IPCO 2007»
14 years 11 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
RTCSA
2005
IEEE
15 years 3 months ago
Scheduling Support for Guaranteed Time Services in IEEE 802.15.4 Low Rate WPAN
We propose a real-time message scheduling algorithm which is applied to schedule periodic realtime messages in IEEE 802.15.4 for LR-WPAN(Low Rate Wireless Personal Area Network). ...
Seongeun Yoo, Daeyoung Kim, Minh-Long Pham, Yoonme...
JSSPP
2009
Springer
15 years 4 months ago
Scheduling Restartable Jobs with Short Test Runs
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
Ojaswirajanya Thebe, David P. Bunde, Vitus J. Leun...
ICPR
2004
IEEE
15 years 10 months ago
Simplest Representation Yet for Gait Recognition: Averaged Silhouette
We present a robust representation for gait recognition that is compact, easy to construct, and affords efficient matching. Instead of a time series based representation comprisin...
Sudeep Sarkar, Zongyi Liu