Efficient false path elimination algorithms for timing verification by event graph preprocessing.
Luc J. M. ClaesenJ. P. SchuppP. DasP. JohannesS. PerremansHugo De ManPublished in: Integr. (1989)
Keyphrases
- preprocessing
- computationally expensive
- computationally efficient
- graph theory
- significant improvement
- computationally intensive
- optimization problems
- learning algorithm
- feature extraction
- elimination algorithm
- random walk
- computational cost
- data structure
- xml documents
- weighted graph
- decision trees
- pruning strategy
- social networks