Now showing items 31-33 of 99

    • Trade-offs between selection complexity and performance when searching the plane without communication 

      Lenzen, Christoph; Newport, Calvin Charles; Lynch, Nancy Ann; Radeva, Tsvetomira T. (Association for Computing Machinery (ACM), 2014-07)
      We argue that in the context of biology-inspired problems in computer science, in addition to studying the time complexity of solutions it is also important to study the selection complexity, a measure of how likely a given ...
    • Bounded-Contention Coding for wireless networks in the high SNR regime 

      Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy Ann; Medard, Muriel (2015-04)
      Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
    • Distributed House-Hunting in Ant Colonies 

      Ghaffari, Mohsen; Musco, Cameron Nicholas; Radeva, Tsvetomira T.; Lynch, Nancy Ann (Association for Computing Machinery (ACM), 2015-07)
      We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. ...