Sciweavers

2343 search results - page 218 / 469
» The Locomotive Routing Problem
Sort
View
WWW
2004
ACM
16 years 7 months ago
Hybrid multicasting in large-scale service networks
The importance of service composition has been widely recognized in the Internet research community due to its high flexibility in allowing development of customized applications....
Jingwen Jin, Klara Nahrstedt
NOMS
2008
IEEE
16 years 27 days ago
Self-tuning network support for MANETs
Abstract—Rapid and unpredictable topology changes and resource constraints make delivering packets in a MANET (Mobile Ad hoc Network) a challenging task. Routing information has ...
Yangcheng Huang, Saleem N. Bhatti, Søren-Ak...
FBIT
2007
IEEE
16 years 25 days ago
Adaptive Data Dissemination in Sensor Networks Using WPDD
In Wireless Sensor Networks (WSNs), address-based routing approaches often lead to severe problems due to node mobility, energy-saving sleep-cycles, and often missing or unreliabl...
Falko Dressler, Reinhard German, Bettina Krüg...
CIC
2003
140views Communications» more  CIC 2003»
15 years 8 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
16 years 6 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...