Sciweavers

392 search results - page 42 / 79
» Maximal Completion
Sort
View
PCI
2005
Springer
14 years 2 months ago
Tuning Blocked Array Layouts to Exploit Memory Hierarchy in SMT Architectures
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
Evangelia Athanasaki, Kornilios Kourtis, Nikos Ana...
IPCCC
2007
IEEE
14 years 3 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
WSC
2007
13 years 11 months ago
Simulation of adaptive project management analytics
Typically, IT projects are delivered over-budget and behind schedule. In this paper, we explore the effects of common project management practices that contribute to these problem...
Léa Amandine Deleris, Sugato Bagchi, Shubir...
CATA
2003
13 years 10 months ago
A Task Migration Scheme for High Performance Real-Time Cluster System
In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize...
Makoto Suzuki, Hidenori Kobayashi, Nobuyuki Yamasa...