Solving SAT problem by heuristic polarity decision-making algorithm.
Ming-e JingDian ZhouPushan TangXiaofang ZhouHua ZhangPublished in: Sci. China Ser. F Inf. Sci. (2007)
Keyphrases
- decision making
- dynamic programming
- random sat instances
- computational complexity
- optimal solution
- randomly generated
- combinatorial optimization
- search strategy
- np hard
- information retrieval systems
- particle swarm optimization
- simulated annealing
- learning algorithm
- genetic algorithm
- tabu search
- evolutionary algorithm
- data structure
- stochastic local search
- sat solving
- backtracking search