1485 search results - page 21 / 297 » Whole Program Paths |
NETCOOP
2007
Springer
14 years 1 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
—The properties of dissipative haptic displays allow larger workspaces that permit a whole body interaction useful for sports, rehabilitation, and large-scale object design appli...
DAIS
2003
13 years 9 months ago
2003
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...