398 search results - page 2 / 80 » Ant Algorithm for the Graph Matching Problem |
LSSC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
IPL
2008
13 years 4 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
SLS
2009
Springer
13 years 11 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
COCO
2010
Springer
13 years 2 months ago
2010
Springer
An even cycle in a graph is called nice by Lov