Sciweavers

151 search results - page 29 / 31
» Minimizing Movement in Mobile Facility Location Problems
Sort
View
PODC
2010
ACM
15 years 1 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
FOCS
2007
IEEE
15 years 3 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
AI
2011
Springer
14 years 4 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
84
Voted
CF
2009
ACM
15 years 3 months ago
Space-and-time efficient garbage collectors for parallel systems
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Shaoshan Liu, Ligang Wang, Xiao-Feng Li, Jean-Luc ...
84
Voted
MOBICOM
2004
ACM
15 years 2 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu