Sciweavers

709 search results - page 45 / 142
» coordination 2010
Sort
View
159
Voted
ATAL
2010
Springer
15 years 7 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
AI
2010
Springer
15 years 10 months ago
On Multi-robot Area Coverage
Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly conta...
Pooyan Fazli
149
Voted
ATAL
2010
Springer
15 years 7 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
CHES
2010
Springer
132views Cryptology» more  CHES 2010»
15 years 7 months ago
Efficient Techniques for High-Speed Elliptic Curve Cryptography
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
Patrick Longa, Catherine H. Gebotys
ICML
2010
IEEE
15 years 6 months ago
The Elastic Embedding Algorithm for Dimensionality Reduction
We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the d...
Miguel Á. Carreira-Perpiñán