Sciweavers

12659 search results - page 312 / 2532
» The distributed breakout algorithms
Sort
View
ICRA
2009
IEEE
145views Robotics» more  ICRA 2009»
16 years 1 months ago
Distributed maximum a posteriori estimation for multi-robot cooperative localization
— This paper presents a distributed Maximum A Posteriori (MAP) estimator for multi-robot Cooperative Localization (CL). As opposed to centralized MAP-based CL, the proposed algor...
Esha D. Nerurkar, Stergios I. Roumeliotis, Agostin...
FOCS
2005
IEEE
16 years 13 days ago
On Learning Mixtures of Heavy-Tailed Distributions
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinbe...
IPPS
2007
IEEE
16 years 1 months ago
Combining Compression, Encryption and Fault-tolerant Coding for Distributed Storage
Storing data in distributed systems aims to offer higher bandwidth and scalability than storing locally. But, a couple of disadvantageous issues must be taken into account such as...
Peter Sobe, Kathrin Peter
CP
2005
Springer
16 years 11 days ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
16 years 10 days ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint