2612 search results - page 359 / 523 » Switching Graphs and Their Complexity |
145
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
134
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
149
click to vote
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
134
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
143
click to vote
DIALM
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...