Sciweavers

2814 search results - page 134 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
125
Voted
AAAI
2000
15 years 3 months ago
Monte Carlo Localization with Mixture Proposal Distribution
Monte Carlo localization (MCL) is a Bayesian algorithm for mobile robot localization based on particle filters, which has enjoyed great practical success. This paper points out a ...
Sebastian Thrun, Dieter Fox, Wolfram Burgard
115
Voted
WDAG
2010
Springer
158views Algorithms» more  WDAG 2010»
15 years 27 days ago
Distributed Contention Resolution in Wireless Networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking
104
Voted
DAC
2002
ACM
16 years 3 months ago
Model order reduction for strictly passive and causal distributed systems
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algor...
Luca Daniel, Joel R. Phillips
113
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
125
Voted
ICPP
2009
IEEE
15 years 8 days ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun