![]() |
Volumn 4, Issue 2, 1992, Pages 145-165
|
Allocating hard real-time tasks: An NP-Hard problem made easy
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
DISTRIBUTED COMPUTER SYSTEMS;
TASK ALLOCATION PROBLEM;
REAL TIME SYSTEMS;
|
EID: 0026865757
PISSN: 09226443
EISSN: 15731383
Source Type: Journal
DOI: 10.1007/BF00365407 Document Type: Article |
Times cited : (240)
|
References (20)
|