Sciweavers

860 search results - page 133 / 172
» Biased Random Walks
Sort
View
ICRA
2009
IEEE
185views Robotics» more  ICRA 2009»
15 years 4 months ago
Ad-hoc wireless network coverage with networked robots that cannot localize
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
INFOCOM
2009
IEEE
15 years 4 months ago
Respondent-Driven Sampling for Characterizing Unstructured Overlays
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
Amir Hassan Rasti, Mojtaba Torkjazi, Reza Rejaie, ...
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
15 years 4 months ago
Segregation in swarms of mobile robots based on the Brazil nut effect
— We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain...
Roderich Groß, Stéphane Magnenat, Fra...
SAGA
2009
Springer
15 years 4 months ago
Economical Caching with Stochastic Prices
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
Matthias Englert, Berthold Vöcking, Melanie W...
RECSYS
2009
ACM
15 years 4 months ago
Using a trust network to improve top-N recommendation
Top-N item recommendation is one of the important tasks of recommenders. Collaborative filtering is the most popular approach to building recommender systems which can predict ra...
Mohsen Jamali, Martin Ester