Sciweavers

2343 search results - page 430 / 469
» The Locomotive Routing Problem
Sort
View
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 9 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
TMA
2012
Springer
254views Management» more  TMA 2012»
12 years 5 months ago
Steps towards the Extraction of Vehicular Mobility Patterns from 3G Signaling Data
Abstract. The signaling traffic of a cellular network is rich of information related to the movements of its devices across cell boundaries. Thus, passive monitoring of anonymized ...
Pierdomenico Fiadino, Danilo Valerio, Fabio Riccia...
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 3 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
GIS
2005
ACM
14 years 11 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 10 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd