206 search results - page 3 / 42 » Ant colony optimization and the minimum cut problem |
AUSAI
2005
Springer
13 years 8 months ago
2005
Springer
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
ANTSW
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
SWARM
2012
SPRINGER
12 years 1 months ago
2012
SPRINGER
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
GECCO
2004
Springer
13 years 11 months 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
2010
Springer
13 years 10 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...