224 search results - page 28 / 45 » Quick-and-dirty ant colony optimization |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
GECCO
2004
Springer
14 years 28 days 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...
EVOW
2005
Springer
14 years 1 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...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...