Least-commitment graph matching with genetic algorithms
- 1 February 2001
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 34 (2) , 375-394
- https://doi.org/10.1016/s0031-3203(99)00217-4
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Structural matching by discrete relaxationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- A Bayesian compatibility model for graph matchingPattern Recognition Letters, 1996
- Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-FragmentsEvolutionary Computation, 1994
- An edge detection technique using genetic algorithm-based optimizationPattern Recognition, 1994
- Unsupervised image segmentation using a distributed genetic algorithmPattern Recognition, 1994
- Analysis of genetic algorithms using statistical mechanicsPhysical Review Letters, 1994
- An analysis of the interacting roles of population size and crossover in genetic algorithmsPublished by Springer Nature ,1991
- GENITOR II: a distributed genetic algorithmJournal of Experimental & Theoretical Artificial Intelligence, 1990
- Discrete relaxationPattern Recognition, 1990
- Simulation of biological evolution and machine learningJournal of Theoretical Biology, 1967