398 search results - page 1 / 80 » Ant Algorithm for the Graph Matching Problem |
EVOW
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
EVOW
2007
Springer
13 years 10 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known