Sciweavers

445 search results - page 53 / 89
» Maximizable Routing Metrics
Sort
View
IPSN
2011
Springer
14 years 1 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
PODC
2005
ACM
15 years 3 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
SIGCOMM
2005
ACM
15 years 3 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
HT
2000
ACM
15 years 2 months ago
The travails of visually impaired web travellers
This paper proposes the inclusion of travel and mobility in the usability metrics of web design. Hypertext design and usability has traditionally concentrated upon navigation and/...
Carole A. Goble, Simon Harper, Robert Stevens
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
14 years 7 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...