A variation-tolerant scheduler for better than worst-case behavioral synthesis.
Jason CongAlbert LiuBin LiuPublished in: CODES+ISSS (2009)
Keyphrases
- worst case
- average case
- upper bound
- lower bound
- greedy algorithm
- error bounds
- approximation algorithms
- program synthesis
- worst case analysis
- scheduling algorithm
- np hard
- image sequences
- e learning
- real time
- theoretical analysis
- optimal solution
- learning algorithm
- texture synthesis
- neural network
- data sets
- complexity bounds