945 search results - page 24 / 189 » Working the Flow |
VISUALIZATION
1992
IEEE
13 years 11 months ago
1992
IEEE
We describe an implementation of a virtual environment for visualizing the geometry of curved spacetime by the display of interactive geodesics. This technique displays the paths ...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
ICNP
1997
IEEE
13 years 12 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
WCE
2007
13 years 8 months ago
2007
— The FDV method was originally developed by T.J. Chung [3]-[6]. The authors developed and presented a modification to this method named MFDV method in [2]. The aim of this modif...