107 search results - page 5 / 22 » Searching for Maximum Cliques with Ant Colony Optimization |
PPSN
2010
Springer
13 years 5 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 ...
EVOW
2006
Springer
13 years 11 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...
CP
2003
Springer
14 years 21 days ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
ASIAN
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
IJACTAICIT
2010
13 years 2 months ago
2010