skip to main content

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Su, Hsin-Hao"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ( , ACM)
  2. ; ; ( , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms)
  3. ; ( , ACM Symposium on Principles of Distributed Computing)
    Full Text Available 
  4. ; ; ( , SIAM Journal on Discrete Mathematics)
    Full Text Available 
  5. ; ; ( , ACM Symposium on Parallelism in Algorithms and Architectures)
    Full Text Available 
  6. ; ( , ACM Symposium on Principles of Distributed Computing)
    Full Text Available 
  7. ; ; ( , ACM Symposium on Principles of Distributed Computing)
    Full Text Available 
  8. ; ( , 34th International Symposium on Distributed Computing, {DISC} 2020,)
    Accepted Manuscript Full Text Available
  9. ; ( , 7th Workshop on Biological Distributed Algorithms (BDA))
    We study the problem of distributed task allocation in multi-agent systems e.g. the division of labor in an ant colony or robot swarm. Suppose there is a collection of agents, a collection of tasks, and a demand vector, which specifies the number of agents required to perform each task.The goal of the agents is to collectively allocate themselves to the tasks to satisfy the demand vector. We study the dynamic version of the problem where the demand vector changes overtime. Here, the goal is to minimize the switching cost, which is the number of agents that change tasks in response to a change in the demand vector. The switching cost is an important metric since changing tasks may incur significant overhead.We study a mathematical formalization of the above problem introduced by Su, Su, Dornhaus, and Lynch [21]. We prove the first non-trivial lower bounds for the switching cost. 
    more » « less
    Accepted Manuscript Full Text Available
  10. ; ; ( , ACM Transactions on Algorithms)
    Full Text Available