266 search results - page 47 / 54 » Graphs with Bounded Induced Distance |
IJRR
2008
13 years 9 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
TROB
2008
13 years 8 months ago
2008
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
INFOCOM
2011
IEEE
13 years 11 days ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...