68 search results - page 9 / 14 » A Reach and Bound algorithm for acyclic dynamic-programming ... |
WINET
2010
13 years 5 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—This paper presents a new task assignment algorithm that integrates area search and target tracking. A new tracking metric is derived that encodes the ability of each ro...
COMGEO
2010
ACM
13 years 6 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
DIALM
2003
ACM
13 years 12 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...