Sciweavers

562 search results - page 58 / 113
» Mapping a Fault-Tolerant Distributed Algorithm to Systems on...
Sort
View
PDP
2008
IEEE
15 years 4 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
ICRA
2010
IEEE
116views Robotics» more  ICRA 2010»
14 years 8 months ago
Learning visibility of landmarks for vision-based localization
— We aim to perform robust and fast vision-based localization using a pre-existing large map of the scene. A key step in localization is associating the features extracted from t...
Pablo Fernández Alcantarilla, Sang Min Oh, ...
HPDC
2010
IEEE
14 years 10 months ago
MOON: MapReduce On Opportunistic eNvironments
MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavaila...
Heshan Lin, Xiaosong Ma, Jeremy S. Archuleta, Wu-c...
87
Voted
RTAS
1999
IEEE
15 years 2 months ago
Timing Constraint Remapping to Avoid Time Discontinuities in Distributed Real-Time Systems
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
Minsoo Ryu, Jungkeun Park, Seongsoo Hong
CONTEXT
2003
Springer
15 years 2 months ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...