Sciweavers

608 search results - page 68 / 122
» Random Systems with Complete Connections
Sort
View
ATAL
2003
Springer
15 years 3 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
15 years 4 months ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...
ICRA
2006
IEEE
144views Robotics» more  ICRA 2006»
15 years 3 months ago
Adapting Probabilistic Roadmaps to Handle Uncertain Maps
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...
Patrycja E. Missiuro, Nicholas Roy
ISCAS
2003
IEEE
89views Hardware» more  ISCAS 2003»
15 years 3 months ago
Timing-mismatch analysis in high-speed analog front-end with nonuniformly holding output
This paper will present a practical and complete analysis of timing-mismatch effects for high-speed Analog Front-End (AFE) systems with the inherent nonuniformly holding outputs. ...
Sai-Weng Sin, Seng-Pan U., Rui Paulo Martins, Jos&...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 9 months ago
Robust Matrix Decomposition with Outliers
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
Daniel Hsu, Sham M. Kakade, Tong Zhang