50 search results - page 4 / 10 » A Memetic Algorithm for the Optimum Communication Spanning T... |
CIAC
2000
Springer
13 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
SAC
2009
ACM
13 years 11 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
DIALM
2008
ACM
13 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
NOMS
2008
IEEE
14 years 20 days ago
2008
IEEE
— To support large-scale Internet-based broadcast of live streaming video efficiently in content delivery networks (CDNs), it is essential to implement a cost-effective overlay ...
SIGCOMM
2000
ACM
13 years 10 months ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...