A new algorithm for the binate covering problem and its application to the minimization of Boolean relations.
Seh-Woong JeongFabio SomenziPublished in: ICCAD (1992)
Keyphrases
- times faster
- high accuracy
- experimental evaluation
- dynamic programming
- improved algorithm
- k means
- learning algorithm
- detection algorithm
- preprocessing
- search space
- computational cost
- simulated annealing
- objective function
- search algorithm
- optimal solution
- neural network
- computationally efficient
- similarity measure
- classification algorithm
- minimum volume
- error function
- recognition algorithm
- matching algorithm
- clustering method
- optimization algorithm
- np complete
- expectation maximization
- np hard
- significant improvement