Sciweavers

618 search results - page 68 / 124
» Short cycle connectivity
Sort
View
IJHR
2008
155views more  IJHR 2008»
14 years 11 months ago
The Challenge of Motion Planning for Soccer Playing Humanoid Robots
Motion planning for humanoids faces several challenging issues: high dimensionality of the configuration space, necessity to address balance constraints in single and double suppo...
Stefano Carpin, Marcelo Kallmann, Enrico Pagello
FGCS
2006
88views more  FGCS 2006»
14 years 11 months ago
Token based networking: Experiment NL-101
This short communication outlines an experiment where tokens, associated with application oriented IP streams, authorize access to an optical lightpath during iGrid 2005. The expe...
Leon Gommans, Bas van Oudenaarde, Alfred Wan, Cees...
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
14 years 11 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
MCS
2007
Springer
14 years 11 months ago
Nonlinearity from linearity: The Ermakov-Pinney equation revisited
In this short note, we revisit the so-called Ermakov–Pinney (EP) equation viewing its properties from a physically motivated perspective. We discuss its ties with the Schr¨odin...
Panayotis G. Kevrekidis, Yannis Drossinos
OPODIS
2007
15 years 1 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet