Abstract
This paper focuses on the optimal assignment of a chain-structured medical task onto a chain of networked devices, a need identified in context-aware mobile healthcare applications. We propose a graph-based method to compute the assignment which has the minimal end-to-end process and transfer delay. In essence, the method transforms the assignment problem to a shortest path problem in a graph representing all possible assignments. Compared to earlier work, our method relaxes a so-called contiguity constraint, which is a necessity in the earlier case but unnecessarily constraining in the healthcare applications. The proposed method reduces the time and space complexity in case it is adapted to include the contiguity constraint.
Original language | Undefined |
---|---|
Title of host publication | International Conference on Computational Science (3) |
Publisher | Springer |
Pages | 424-431 |
Number of pages | 8 |
ISBN (Print) | 978-3-540-72587-9 |
DOIs | |
Publication status | Published - 14 Jul 2007 |
Event | 10th International Conference on Computational Science, ICCS 2010 - University of Amsterdam, Amsterdam, Netherlands Duration: 31 May 2010 → 2 Jun 2010 Conference number: 10 https://www.iccs-meeting.org/iccs2010/ |
Publication series
Name | |
---|---|
Publisher | Springer Verlag |
Number | 67310A |
Conference
Conference | 10th International Conference on Computational Science, ICCS 2010 |
---|---|
Abbreviated title | ICCS 2010 |
Country/Territory | Netherlands |
City | Amsterdam |
Period | 31/05/10 → 2/06/10 |
Internet address |
Keywords
- EWI-11642
- METIS-245895
- Graph-based - task assignment - contiguity constraint - M-health
- IR-62083