Sciweavers

1989 search results - page 136 / 398
» cost 2010
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
15 years 4 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
JSSPP
2010
Springer
15 years 4 months ago
Dynamic Proportional Share Scheduling in Hadoop
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
Thomas Sandholm, Kevin Lai
228
Voted
MOBIHOC
2010
ACM
15 years 4 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
SEMWEB
2010
Springer
15 years 4 months ago
Optimize First, Buy Later: Analyzing Metrics to Ramp-Up Very Large Knowledge Bases
As knowledge bases move into the landscape of larger ontologies and have terabytes of related data, we must work on optimizing the performance of our tools. We are easily tempted t...
Paea LePendu, Natalya Fridman Noy, Clement Jonquet...