16404 search results - page 516 / 3281 » A set coverage problem |
152
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
196
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
179
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
175
click to vote
ISCI
2010
15 years 5 months ago
2010
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
232
click to vote
FLAIRS
2009
15 years 4 months ago
2009
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...