16404 search results - page 415 / 3281 » A set coverage problem |
192
click to vote
JMLR
2010
15 years 1 months ago
2010
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
163
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
150
click to vote
EVOW
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
138
click to vote
SPIRE
2004
Springer
16 years 2 days ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
172
click to vote
EMO
2003
Springer
15 years 12 months ago
2003
Springer
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...