Sciweavers

321 search results - page 26 / 65
» Enabling local computation for partially ordered preferences
Sort
View
IROS
2006
IEEE
111views Robotics» more  IROS 2006»
14 years 1 months ago
A Combined Monte-Carlo Localization and Tracking Algorithm for RoboCup
— Self-localization is a major research task in mobile robotics for several years. Efficient self-localization methods have been developed, among which probabilistic Monte-Carlo...
Patrick Heinemann, Jürgen Haase, Andreas Zell
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 9 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
JFR
2007
163views more  JFR 2007»
13 years 7 months ago
Real-time localization and elevation mapping within urban search and rescue scenarios
Urban Search And Rescue (USAR) is a time critical task. Rescue teams have to explore a large terrain within a short amount of time in order to locate survivors after a disaster. O...
Alexander Kleiner, Christian Dornhege
IEEESCC
2007
IEEE
14 years 1 months ago
A Service Architecture for Context Awareness and Reaction Provisioning
Context awareness has emerged as an important element in distributed computing. It offers mechanisms allowing applications to be aware of their environment and enabling them to ad...
Luiz Olavo Bonino da Silva Santos, Fano Ramparany,...
IPPS
1999
IEEE
13 years 12 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...