Sciweavers

1612 search results - page 69 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
OPODIS
2010
14 years 7 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...
ICDCS
2008
IEEE
15 years 4 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
JCO
2006
234views more  JCO 2006»
14 years 9 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
TCS
2010
14 years 8 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
WSC
2008
15 years 3 days ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...