A Dynamic Expansion Order Algorithm for the SAT-based Minimization.
Chia-Chun LinKit Seng TamChana-Cheng KoHsin-Ping YenShenz-Hsiu WeiYung-Chih ChenChun-Yao WangPublished in: SoCC (2020)
Keyphrases
- learning algorithm
- objective function
- computational complexity
- dynamic programming
- high accuracy
- computational cost
- k means
- experimental evaluation
- genetic algorithm
- times faster
- detection algorithm
- dynamic environments
- neural network
- significant improvement
- optimal solution
- reinforcement learning
- segmentation algorithm
- matching algorithm
- randomly generated
- cost function
- active learning
- preprocessing
- worst case
- simulated annealing
- expectation maximization
- bayesian networks