701 search results - page 29 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
CCIA
2005
Springer
13 years 9 months ago
2005
Springer
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
ISPD
2012
ACM
12 years 3 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...