Sciweavers

1447 search results - page 215 / 290
» Graphs and Path Equilibria
Sort
View
VR
1993
IEEE
15 years 10 months ago
A Virtual World for Network Management
Existing network management systems typically use a combination of textual displays and 2D directed graph representations of network topology. We are designing a network managemen...
Steven Feiner, Michelle X. Zhou, Laurence A. Crutc...
CONEXT
2007
ACM
15 years 10 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 10 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
PODS
1991
ACM
98views Database» more  PODS 1991»
15 years 10 months ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 7 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani