Sciweavers

228 search results - page 32 / 46
» Online Routing in Triangulations
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
FOCS
2003
IEEE
14 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ATAL
2007
Springer
14 years 23 days ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
ACL
2009
13 years 6 months ago
A NLG-based Application for Walking Directions
This work describes an online application that uses Natural Language Generation (NLG) methods to generate walking directions in combination with dynamic 2D visualisation. We make ...
Michael Roth, Anette Frank
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh