Optimal multiprocessor implementations from a serial algorithm specification.
S. H. LeeThomas P. Barnwell IIIPublished in: ICASSP (1988)
Keyphrases
- dynamic programming
- worst case
- detection algorithm
- np hard
- globally optimal
- computational cost
- computationally efficient
- closed form
- learning algorithm
- high accuracy
- cost function
- search space
- preprocessing
- optimal solution
- experimental evaluation
- significant improvement
- k means
- computational complexity
- theoretical analysis
- times faster
- improved algorithm
- path planning
- parallel implementation
- optimal assignment
- single processor
- input data
- multiprocessor architecture
- space complexity
- recognition algorithm
- tree structure
- clustering method
- probabilistic model
- objective function