Sciweavers

15 search results - page 2 / 3
» Box Constraint Collections for Adhoc Constraints
Sort
View
IROS
2007
IEEE
92views Robotics» more  IROS 2007»
13 years 11 months ago
A space decomposition method for path planning of loop linkages
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
Josep M. Porta, Juan Cortés, Lluís R...
PLDI
2005
ACM
13 years 10 months ago
Programming ad-hoc networks of mobile and resource-constrained devices
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
Yang Ni, Ulrich Kremer, Adrian Stere, Liviu Iftode
AAAI
2007
13 years 7 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
VMCAI
2009
Springer
14 years 1 days ago
Reducing Behavioural to Structural Properties of Programs with Procedures
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
Dilian Gurov, Marieke Huisman
ADHOCNOW
2008
Springer
13 years 11 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...