398 search results - page 4 / 80 » Ant Algorithm for the Graph Matching Problem |
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
ANTSW
2004
Springer
13 years 11 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
IPPS
2003
IEEE
14 years 27 days ago
2003
IEEE
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...