Search
Now showing items 1-4 of 4
Brief Announcement: Partial Reversal Acyclicity
(Association for Computing Machinery (ACM), 2011)
Partial Reversal (PR) is a link reversal algorithm which ensures that an initially directed acyclic graph (DAG) is eventually a destination-oriented DAG. While proofs exist to establish the acyclicity property of PR, they ...
Distributed House-Hunting in Ant Colonies
(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. ...
Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems
(Public Library of Science (PLoS), 2017-12)
Adaptive collective systems are common in biology and beyond. Typically, such systems require a task allocation algorithm: a mechanism or rule-set by which individuals select particular roles. Here we study the performance ...
Trade-offs between selection complexity and performance when searching the plane without communication
(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 ...