Sciweavers

559 search results - page 104 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
IJRR
2011
174views more  IJRR 2011»
13 years 3 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
INFOCOM
2008
IEEE
14 years 3 months ago
Real-Time Video Multicast in WiMAX Networks
Abstract—IEEE 802.16e WiMAX is a promising new technology for broadband access networks. Amongst the class of applications that can be supported is real time video services (such...
Supratim Deb, Sharad Jaiswal, Kanthi Nagaraj
NOMS
2008
IEEE
14 years 3 months ago
Self-tuning network support for MANETs
Abstract—Rapid and unpredictable topology changes and resource constraints make delivering packets in a MANET (Mobile Ad hoc Network) a challenging task. Routing information has ...
Yangcheng Huang, Saleem N. Bhatti, Søren-Ak...
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 2 months ago
Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case
Abstract— This paper presents a new approach to the multirobot map-alignment problem that enables teams of robots to build joint maps without initial knowledge of their relative ...
Xun S. Zhou, Stergios I. Roumeliotis
CVPR
2009
IEEE
15 years 3 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...