2299 search results - page 410 / 460 » A Class of Hypercube-Like Networks |
CSCW
2000
ACM
14 years 8 hour ago
2000
ACM
In this paper we investigate how consistency can be ensured for replicated continuous interactive media, i.e., replicated media which change their state in reaction to user initia...
SIGCOMM
2000
ACM
14 years 4 hour ago
2000
ACM
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
APPROX
2000
Springer
13 years 12 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
CP
2000
Springer
13 years 12 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
PPOPP
1999
ACM
13 years 12 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...