Sciweavers

206 search results - page 27 / 42
» Ant colony optimization and the minimum cut problem
Sort
View
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
GECCO
2009
Springer
169views Optimization» more  GECCO 2009»
15 years 2 months ago
An ant based algorithm for task allocation in large-scale and dynamic multiagent scenarios
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
Fernando dos Santos, Ana L. C. Bazzan
CEC
2007
IEEE
15 years 4 months ago
Computational chemotaxis in ants and bacteria over dynamic environments
— Chemotaxis can be defined as an innate behavioural response by an organism to a directional stimulus, in which bacteria, and other single-cell or multicellular organisms direct...
Vitorino Ramos, Carlos Fernandes, Agostinho C. Ros...
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 1 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 1 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger