701 search results - page 31 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
ANTSW
2004
Springer
13 years 11 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
IPPS
2003
IEEE
14 years 20 days ago
2003
IEEE
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
NETWORKS
2011
13 years 2 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
WEA
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...