Cost-Based Heuristics and Node Re-Expansions across the Phase Transition.
Eldan CohenJ. Christopher BeckPublished in: SOCS (2017)
Keyphrases
- phase transition
- random instances
- hard problems
- small world networks
- constraint satisfaction
- randomly generated
- satisfiability problem
- np complete
- combinatorial problems
- random constraint satisfaction problems
- graph coloring
- hamiltonian cycle
- stochastic local search
- cellular automata
- random graphs
- sat problem
- heuristic search
- average degree
- search algorithm
- minimum cost
- heuristic function
- search strategies
- directed graph
- np complete problems