Sciweavers

1594 search results - page 239 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
132
Voted
FSTTCS
2009
Springer
15 years 9 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
15 years 9 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
ICCCN
2007
IEEE
15 years 9 months ago
On Improving the Precision of Localization with Minimum Resource Allocation
— Autonomous localization of nodes in wireless sensor networks is essential to minimize the complex self organization task and consequently enhancing the overall network lifetime...
Frank Reichenbach, Dirk Timmermann
ICRA
2007
IEEE
165views Robotics» more  ICRA 2007»
15 years 9 months ago
Adaptive Sampling for Estimating a Scalar Field using a Robotic Boat and a Sensor Network
Abstract— This paper introduces an adaptive sampling algorithm for a mobile sensor network to estimate a scalar field. The sensor network consists of static nodes and one mobile...
Bin Zhang, Gaurav S. Sukhatme
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 9 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni