7015 search results - page 307 / 1403 » Approximation algorithms for co-clustering |
160
click to vote
AUSAI
2004
Springer
16 years 2 days ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
162
Voted
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
175
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
150
click to vote
ICALP
2005
Springer
16 years 6 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 ...
157
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...