345 search results - page 7 / 69 » Ant Colony Optimization for Multi-Objective Optimization Pro... |
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
ICICIC
2006
IEEE
15 years 3 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
PPSN
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
EVOW
2006
Springer
15 years 1 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...