790 search results - page 59 / 158 » Subexponential Parameterized Algorithms |
130
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
138
click to vote
SIGADA
2004
Springer
15 years 8 months ago
2004
Springer
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
113
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
129
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
145
click to vote
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...