DOI: 10.3990/1.9789036530262
|View full text |Cite
|
Sign up to set email alerts
|

Task distribution based adaptation in mobile patient monitoring systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 106 publications
(100 reference statements)
0
1
0
Order By: Relevance
“…The optimal assignment of tasks to the available agents is a well-known mathematical NP-hard problem which is manifested in many application domains. To solve this class of problems, various approaches have been proposed that may also be adopted for the distribution of MADE processes, from exact A*-based algorithms for small-scale problems to heuristic algorithms which involve multiple iterations of task clustering (Mei, 2010). However, for the MADE framework, the assignment problem is complicated by a number of factors, such as the possible presence of specialised devices (e.g.…”
Section: Mechanisms For the Distribution Of Knowledgementioning
confidence: 99%
“…The optimal assignment of tasks to the available agents is a well-known mathematical NP-hard problem which is manifested in many application domains. To solve this class of problems, various approaches have been proposed that may also be adopted for the distribution of MADE processes, from exact A*-based algorithms for small-scale problems to heuristic algorithms which involve multiple iterations of task clustering (Mei, 2010). However, for the MADE framework, the assignment problem is complicated by a number of factors, such as the possible presence of specialised devices (e.g.…”
Section: Mechanisms For the Distribution Of Knowledgementioning
confidence: 99%