5595 search results - page 291 / 1119 » Approximation Algorithms for Clustering Problems |
225
click to vote
IMCSIT
2010
15 years 3 months ago
2010
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
178
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
186
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
183
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
135
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...