|
Volumn 3203, Issue , 2004, Pages 251-260
|
The partition into hypercontexts problem for hyperreconfigurable architectures
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATION THEORY;
DYNAMIC MODELS;
POLYNOMIAL APPROXIMATION;
ALGORITHMIC ASPECTS;
APPLICATION PROBLEMS;
FAST DYNAMICS;
HYPERCONTEXTS;
NP-HARD;
POLYNOMIAL-TIME ALGORITHMS;
RECONFIGURATION ABILITY;
RUNTIMES;
PROBLEM SOLVING;
|
EID: 35048898746
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-30117-2_27 Document Type: Article |
Times cited : (3)
|
References (17)
|