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

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

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 algorithmic strategy is to arise in nature. In this spirit, we propose a sel...

Full description

Bibliographic Details
Main Authors: Lenzen, Christoph (Contributor), Newport, Calvin Charles (Author), Lynch, Nancy Ann (Contributor), Radeva, Tsvetomira T. (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2016-01-15T02:33:01Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items