1095 search results - page 69 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
TIT
2008
14 years 10 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
108
Voted
DEXA
2010
Springer
14 years 10 months ago
2010
Springer
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
WIOPT
2006
IEEE
15 years 4 months ago
2006
IEEE
— Channel-aware scheduling strategies provide an effective mechanism for improving the throughput performance in wireless data networks by exploiting channel fluctuations. The p...