Polynomial-time algorithm for on-chip scratchpad memory partitioning.
Federico AngioliniLuca BeniniAlberto CapraraPublished in: CASES (2003)
Keyphrases
- computational complexity
- memory usage
- learning algorithm
- memory requirements
- high accuracy
- memory space
- k means
- experimental evaluation
- computational cost
- preprocessing
- recognition algorithm
- cost function
- np hard
- detection algorithm
- worst case
- particle swarm optimization
- linear programming
- strongly polynomial
- image processing algorithms
- segmentation algorithm
- similarity measure
- simulated annealing
- significant improvement
- approximation algorithms
- objective function
- rows and columns
- lower bound
- genetic algorithm
- search space
- hardware implementation
- associative memory
- image segmentation
- dynamic programming
- optimization algorithm
- expectation maximization
- low cost
- optimal solution