Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length.
Héctor Sanvicente SánchezJuan Frausto SolísFroilán Imperial-ValenzuelaPublished in: AAIM (2005)
Keyphrases
- markov chain
- stochastic local search
- np complete problems
- steady state
- hybrid algorithms
- sat problem
- finite state
- backtracking search
- sat solving
- markov model
- satisfiability problem
- computational complexity
- combinatorial optimization
- orders of magnitude
- random walk
- markov process
- propositional satisfiability
- transition probabilities
- np complete
- optimization problems
- special case
- solving hard
- backtracking algorithm
- machine learning