A graph theoretic optimal algorithm for schedule compression in time-multiplexed FPGA partitioning.
Huiqun LiuD. F. WongPublished in: ICCAD (1999)
Keyphrases
- graph theoretic
- dynamic programming
- worst case
- optimal solution
- detection algorithm
- computational complexity
- learning algorithm
- np hard
- objective function
- random graphs
- combinatorial optimization
- image compression
- scheduling problem
- search space
- simulated annealing
- cost function
- image processing algorithms
- k means
- fpga implementation