Graph identification by simulated annealing
- 7 May 1988
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 21 (9) , L487-L490
- https://doi.org/10.1088/0305-4470/21/9/001
Abstract
A new theoretical approach to graph processing, based on the transformation of a topological graph into a time-dependent periodic melody, is proposed. By using a self-tuning oscillatory dynamical network, graphs can be uniquely reconstructed from their melodies. This opens a perspective for a content-addressable memory invariant under large topology-preserving distortions.Keywords
This publication has 7 references indexed in Scilit:
- Decay and diffusion in hierarchically organized systemsZeitschrift für Physik B Condensed Matter, 1988
- Artificial intelligence and large scale computation: A physics perspectivePhysics Reports, 1987
- Phase transitions in artificial intelligence systemsArtificial Intelligence, 1987
- Learning symmetry groups with hidden units: Beyond the perceptronPhysica D: Nonlinear Phenomena, 1986
- Optimization by Simulated AnnealingScience, 1983
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953