224 search results - page 18 / 45 » Quick-and-dirty ant colony optimization |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
ANTSW
2006
Springer
13 years 11 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
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...
ESIAT
2009
IEEE
13 years 5 months ago
2009
IEEE
The applications of Wireless Sensor Networks are seriously constrained by energy supply. So how to prolong the network lifetime is an important and challenging issue, which is the ...