Sciweavers

33 search results - page 2 / 7
» Ant Colony Optimization Approaches to the Degree-constrained...
Sort
View
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 9 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
NI
2011
168views more  NI 2011»
12 years 8 months ago
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
Engin Türetken, Germán González...
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
13 years 9 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
WOB
2004
134views Bioinformatics» more  WOB 2004»
13 years 6 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
13 years 10 months ago
Ant System for the k-Cardinality Tree Problem
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...
Thang Nguyen Bui, Gnanasekaran Sundarraj