Sciweavers

793 search results - page 115 / 159
» Analogical Path Planning
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
CC
2009
Springer
190views System Software» more  CC 2009»
14 years 8 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...
IROS
2009
IEEE
195views Robotics» more  IROS 2009»
14 years 2 months ago
Appearance contrast for fast, robust trail-following
— We describe a framework for finding and tracking “trails” for autonomous outdoor robot navigation. Through a combination of visual cues and ladar-derived structural inform...
Christopher Rasmussen, Yan Lu, Mehmet Kocamaz
IPPS
2006
IEEE
14 years 2 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
ICALP
2004
Springer
14 years 1 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...