We demonstrate the emergence of collective behavior in two evolutionary computation systems, one an evolutionary extension of a classic (highly constrained) flocking algorithm and...
Lee Spector, Jon Klein, Chris Perry, Mark Feinstei...
Advances in high quality digital wireless networks and differentiated services have enabled the development of mobile multimedia applications that can execute in global infrastruct...
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Many network level services such as routing, auto-addressing and, security have been proposed for ad hoc networks. Each has characteristics that may cause it to outperform similar ...
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...