5 search results - page 1 / 1 » On Traversing Layered Graphs On-line |
SODA
1993
ACM
13 years 8 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
MPC
1998
Springer
13 years 11 months ago
1998
Springer
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
CACM
1998
13 years 7 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...