290 search results - page 22 / 58 » Network as a Computer: Ranking Paths to Find Flows |
EOR
2008
14 years 10 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
DEBU
2010
14 years 10 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
SIGCOMM
2010
ACM
14 years 10 months ago
2010
ACM
It is becoming the norm for small mobile devices to have access to multiple technologies for connecting to the Internet. This gives researchers an increasing interest for solution...
IOR
2007
14 years 9 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
CONEXT
2010
ACM
14 years 8 months ago
2010
ACM
Recent measurements and anecdotal evidence indicate that the Internet ecosystem is rapidly evolving from a multi-tier hierarchy built mostly with transit (customer-provider) links...