Sciweavers

671 search results - page 71 / 135
» Context-specific Route Directions
Sort
View
MONET
2006
97views more  MONET 2006»
13 years 7 months ago
Pre-Reply Probe and Route Request Tail: Approaches for Calculation of Intra-Flow Contention in Multihop Wireless Networks
Several applications have been envisioned for multihop wireless networks that require different qualities of service from the network. In order to support such applications, the n...
Kimaya Sanzgiri, Ian D. Chakeres, Elizabeth M. Bel...
SIGCOMM
1999
ACM
14 years 9 hour ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
SIGIR
2010
ACM
13 years 11 months ago
Assessing the scenic route: measuring the value of search trails in web logs
Search trails mined from browser or toolbar logs comprise queries and the post-query pages that users visit. Implicit endorsements from many trails can be useful for search result...
Ryen W. White, Jeff Huang
JAVA
2000
Springer
13 years 11 months ago
Development routes for message passing parallelism in Java
Java is an attractive environment for writing portable message passing parallel programs. Considerable work in message passing interface bindings for the C and Fortran languages h...
J. A. Mathew, Heath A. James, Kenneth A. Hawick
ECCC
2007
147views more  ECCC 2007»
13 years 7 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...