4045 search results - page 729 / 809 » Special Section on Parallel Distributed Computing and Networ... |
114
click to vote
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
115
click to vote
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
76
Voted
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper we propose a novel architecture, CARD, for resource discovery in large scale MANets that may scale up to thousands of nodes. Our mechanism is suitable for resource d...
100
click to vote
PCRCW
1997
Springer
15 years 1 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
105
click to vote
COLCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—In disaster areas, office buildings, or at home, multiple autonomous networked mobile robots may act instead of human beings. These robots have to move to their destination so ...