4233 search results - page 161 / 847 » Three Paths to Effectiveness |
125
click to vote
ICFEM
2000
Springer
15 years 8 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
165
click to vote
INFOCOM
1995
IEEE
15 years 8 months ago
1995
IEEE
We introduce a traffic model for circuit-switched all-optical networks which we then use to calculate the blocking probability along a path for networks with and without wavelength...
135
click to vote
RT
1995
Springer
15 years 8 months ago
1995
Springer
Multiple scattering in participating media is generally a complex phenomenon. In the limit of an optically thick medium, i.e., when the mean free path of each photon is much smalle...
103
click to vote
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...
141
click to vote
SIGCOMM
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...