Sciweavers

169 search results - page 3 / 34
» Decentralized Search with Random Costs
Sort
View
DCOSS
2010
Springer
13 years 10 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 1 months ago
The Cost of Reality: Effects of Real-World Factors on Multi-Robot Search
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
Jim Pugh, Alcherio Martinoli
INFOCOM
2007
IEEE
14 years 1 months ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li
COMSWARE
2008
IEEE
14 years 1 months ago
Community based search on power law networks
—In this paper, we have presented a novel algorithm for searching Peer-to-Peer (P2P) networks which forms power law topology. It is completely decentralized in nature and hence i...
Tathagata Das, Subrata Nandi, Niloy Ganguly
JAIR
2000
123views more  JAIR 2000»
13 years 6 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill