Phase Transitions in Connectionist Models Having Rapidly Varying Connection Strengths.
James A. ReggiaMark EdwardsPublished in: Neural Comput. (1990)
Keyphrases
- phase transition
- connectionist models
- neural network
- constraint satisfaction
- random constraint satisfaction problems
- combinatorial problems
- satisfiability problem
- randomly generated
- cognitive science
- hard problems
- language understanding
- graph coloring
- np complete
- sat problem
- random instances
- random graphs
- np complete problems
- information retrieval
- mobile devices
- search algorithm
- genetic algorithm