Using Lin-Kernighan algorithm for look-up table compression to improve code density.
Talal BonnyJörg HenkelPublished in: ACM Great Lakes Symposium on VLSI (2006)
Keyphrases
- preprocessing
- dynamic programming
- learning algorithm
- optimal solution
- computational complexity
- detection algorithm
- np hard
- k means
- cost function
- computational efficiency
- objective function
- randomly generated
- hardware implementation
- search space
- linear programming
- particle swarm optimization
- source code
- simulated annealing
- convex hull
- density function
- worst case