Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.
Atsuki NagaoKazuhisa SetoJunichi TeruyamaPublished in: ISAAC (2017)
Keyphrases
- cost function
- objective function
- experimental evaluation
- randomly generated
- theoretical analysis
- dynamic programming
- np hard
- computational complexity
- computational cost
- times faster
- tree structure
- significant improvement
- k means
- convergence rate
- probabilistic model
- np complete
- optimization algorithm
- detection algorithm
- worst case
- clustering method
- particle swarm optimization
- simulated annealing
- association rules
- optimal solution