A polynomial-time custom instruction identification algorithm based on dynamic programming.
Junwhan AhnImyong LeeKiyoung ChoiPublished in: ASP-DAC (2011)
Keyphrases
- dynamic programming
- computational complexity
- worst case
- np hard
- learning algorithm
- improved algorithm
- particle swarm optimization
- tree structure
- probabilistic model
- identification rate
- special case
- significant improvement
- high accuracy
- linear programming
- objective function
- computationally efficient
- times faster
- segmentation algorithm
- optimization algorithm
- strongly polynomial
- ant colony optimization
- locally optimal
- scan line
- clustering method
- detection algorithm
- theoretical analysis
- expectation maximization
- state space
- computational cost
- evolutionary algorithm
- decision trees