A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains.
Wei XuFuzhou GongPublished in: FAW (2014)
Keyphrases
- random walk
- constraint satisfaction problems
- pseudo boolean optimization
- constraint satisfaction
- constraint optimization
- learning algorithm
- non binary
- graph coloring problems
- combinatorial problems
- directed graph
- constraint programming
- decomposition methods
- finding optimal solutions
- computational complexity
- forward checking
- multi db
- markov chain
- np complete
- constraint networks
- worst case
- search space
- soft constraints
- web graph
- random instances
- arc consistency
- backtracking algorithm
- space complexity
- backtracking search
- scheduling problem
- reinforcement learning