Sciweavers

1095 search results - page 94 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
KDD
2009
ACM
143views Data Mining» more  KDD 2009»
15 years 10 months ago
Optimizing web traffic via the media scheduling problem
Website traffic varies through time in consistent and predictable ways, with highest traffic in the middle of the day. When providing media content to visitors, it is important to...
Lars Backstrom, Jon M. Kleinberg, Ravi Kumar
ATAL
2008
Springer
15 years 1 days ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
CLUSTER
2000
IEEE
14 years 9 months ago
Block-cyclic redistribution over heterogeneous networks
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. ...
ADHOC
2007
122views more  ADHOC 2007»
14 years 10 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
AMAI
2008
Springer
14 years 10 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka