Sciweavers

1095 search results - page 140 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
WWW
2002
ACM
15 years 10 months ago
Improvements in practical aspects of optimally scheduling web advertising
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
Atsuyoshi Nakamura
ECRTS
1999
IEEE
15 years 2 months ago
QoS guarantee using probabilistic deadlines
This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task inst...
Luca Abeni, Giorgio C. Buttazzo
ADBIS
2007
Springer
124views Database» more  ADBIS 2007»
15 years 4 months ago
Fast and Efficient Log File Compression
Contemporary information systems are replete with log files, created in multiple places (e.g., network servers, database management systems, user monitoring applications, system se...
Przemyslaw Skibinski, Jakub Swacha
KAIS
2006
111views more  KAIS 2006»
14 years 9 months ago
Efficient string matching with wildcards and length constraints
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
Gong Chen, Xindong Wu, Xingquan Zhu, Abdullah N. A...
ISLPED
2010
ACM
158views Hardware» more  ISLPED 2010»
14 years 10 months ago
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
Weixun Wang, Xiaoke Qin, Prabhat Mishra