Phase Transition in SONFIS and SORST.
Hamed O. GhaffariMostafa SharifzadehWitold PedryczPublished in: RSCTC (2008)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- np complete
- combinatorial problems
- randomly generated
- hard problems
- graph coloring
- random constraint satisfaction problems
- cellular automata
- relational learning
- random instances
- deep structure
- sat problem
- np complete problems
- random graphs
- hamiltonian cycle
- stochastic local search
- similarity measure
- np hard
- average degree
- search algorithm