16404 search results - page 478 / 3281 » A set coverage problem |
172
click to vote
MICAI
2005
Springer
16 years 9 days ago
2005
Springer
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
167
click to vote
AUSAI
2004
Springer
16 years 7 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...
174
click to vote
CPM
2004
Springer
16 years 6 days ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
155
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
164
click to vote
ISSAC
2004
Springer
16 years 5 days ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...