Sciweavers

1095 search results - page 139 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 3 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICASSP
2011
IEEE
14 years 1 months ago
Performance optimized predictor blending technique for lossless image coding
The paper presents a lossless coding method based on predictor blending approach that codes nine widely used benchmark images with the lowest average bitrate ever published. At th...
Grzegorz Ulacha, Ryszard Stasinski
CODES
2005
IEEE
15 years 3 months ago
Conflict analysis in multiprocess synthesis for optimized system integration
This paper presents a novel approach for multiprocess synthesis supporting well-tailored module integration at system level. The goal is to extend the local scope of existing arch...
Oliver Bringmann, Wolfgang Rosenstiel, Axel Sieben...
EMSOFT
2008
Springer
14 years 11 months ago
Portioned EDF-based scheduling on multiprocessors
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...
Shinpei Kato, Nobuyuki Yamasaki
IPPS
2005
IEEE
15 years 3 months ago
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein